Independent Set, Induced Matching, and Pricing: Connections and Tight 
(Subexponential Time) Approximation Hardnesses

Chalermsook, Parinya; Laekhanukit, Bundit; Nanongkai, Danupon

doi:10.1109/FOCS.2013.47

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses

MPS-Authors

/persons/resource/persons44225

Chalermsook, Parinya
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45102

Nanongkai, Danupon
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

Link
(Any fulltext)

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

Chalermsook, P., Laekhanukit, B., & Nanongkai, D. (2013). Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. In FOCS 2013 (pp. 370-379). Piscataway, NJ: IEEE. doi:10.1109/FOCS.2013.47.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-4622-B

Abstract

There is no abstract available