Approximate Hypergraph Coloring

Kelsen, Pierre; Mahajan, Sanjeev; Hariharan, Ramesh

doi:10.1007/3-540-61422-2_119

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Approximate Hypergraph Coloring

MPS-Authors

/persons/resource/persons44755

Kelsen, Pierre
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44967

Mahajan, Sanjeev
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44586

Hariharan, Ramesh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dvBUg
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Kelsen, P., Mahajan, S., & Hariharan, R. (1996). Approximate Hypergraph Coloring. In R. Karlsson, & A. Lingas (Eds.), Algorithm Theory - SWAT '96 (pp. 41-52). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AB4A-7

Abstract

There is no abstract available