Approximating Sparsest cut in graphs of bounded treewidth

Eden Chlamtac; Robert Krauthgamer; Prasad Raghavendra

doi:10.1007/978-3-642-15369-3_10

Approximating Sparsest cut in graphs of bounded treewidth

Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

13 Scopus citations

Abstract

We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the flow-cut gap and/or metric embeddings, our approach exploits the Sherali-Adams hierarchy of linear programming relaxations.

Original language	English
Title of host publication	Approximation, Randomization, and Combinatorial Optimization
Subtitle of host publication	Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings
Pages	124-137
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-642-15369-3_10
State	Published - 15 Nov 2010
Externally published	Yes
Event	13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010 - Barcelona, Spain Duration: 1 Sep 2010 → 3 Sep 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6302 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010
Country/Territory	Spain
City	Barcelona
Period	1/09/10 → 3/09/10

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-15369-3_10

Cite this

Chlamtac, E., Krauthgamer, R., & Raghavendra, P. (2010). Approximating Sparsest cut in graphs of bounded treewidth. In Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings (pp. 124-137). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6302 LNCS). https://doi.org/10.1007/978-3-642-15369-3_10

Chlamtac, Eden ; Krauthgamer, Robert ; Raghavendra, Prasad. / Approximating Sparsest cut in graphs of bounded treewidth. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. 2010. pp. 124-137 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5614be76fbba47e58ff7a81d6290fdf4,

title = "Approximating Sparsest cut in graphs of bounded treewidth",

abstract = "We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the flow-cut gap and/or metric embeddings, our approach exploits the Sherali-Adams hierarchy of linear programming relaxations.",

author = "Eden Chlamtac and Robert Krauthgamer and Prasad Raghavendra",

year = "2010",

month = nov,

day = "15",

doi = "10.1007/978-3-642-15369-3_10",

language = "English",

isbn = "3642153682",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "124--137",

booktitle = "Approximation, Randomization, and Combinatorial Optimization",

note = "13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010 ; Conference date: 01-09-2010 Through 03-09-2010",

}

Chlamtac, E, Krauthgamer, R & Raghavendra, P 2010, Approximating Sparsest cut in graphs of bounded treewidth. in Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6302 LNCS, pp. 124-137, 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010, Barcelona, Spain, 1/09/10. https://doi.org/10.1007/978-3-642-15369-3_10

Approximating Sparsest cut in graphs of bounded treewidth. / Chlamtac, Eden; Krauthgamer, Robert; Raghavendra, Prasad.
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. 2010. p. 124-137 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6302 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Approximating Sparsest cut in graphs of bounded treewidth

AU - Chlamtac, Eden

AU - Krauthgamer, Robert

AU - Raghavendra, Prasad

PY - 2010/11/15

Y1 - 2010/11/15

N2 - We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the flow-cut gap and/or metric embeddings, our approach exploits the Sherali-Adams hierarchy of linear programming relaxations.

AB - We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the flow-cut gap and/or metric embeddings, our approach exploits the Sherali-Adams hierarchy of linear programming relaxations.

UR - http://www.scopus.com/inward/record.url?scp=78149352174&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15369-3_10

DO - 10.1007/978-3-642-15369-3_10

M3 - Conference contribution

AN - SCOPUS:78149352174

SN - 3642153682

SN - 9783642153686

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 124

EP - 137

BT - Approximation, Randomization, and Combinatorial Optimization

T2 - 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010 and 14th International Workshop on Randomization and Computation, RANDOM 2010

Y2 - 1 September 2010 through 3 September 2010

ER -

Chlamtac E, Krauthgamer R, Raghavendra P. Approximating Sparsest cut in graphs of bounded treewidth. In Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Proceedings. 2010. p. 124-137. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-15369-3_10

Approximating Sparsest cut in graphs of bounded treewidth

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this