An efficient partitioning oracle for bounded-treewidth graphs
Name
Edelman_An Efficient.pdf
Size
213.63 KB
Format
Adobe PDF
Checksum (MD5)
72cab0bd22d62ce3fa36b46151536920
Author(s)
Hassidim, Avinatan
Onak, Krzysztof
Edelman, Alan
Nguyen, Huy N.
Date Issued
June 2011
Journal
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings
Publisher
Springer-Verlag
Citation
Edelman, Alan et al. “An Efficient Partitioning Oracle for Bounded-Treewidth Graphs.” Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Ed. Leslie Ann Goldberg et al. Vol. 6845. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 530–541. Web. 11 Apr. 2012.
Version
Author's final manuscript
Abstract
Partitioning oracles were introduced by Hassidim et al. (FOCS 2009) as a generic tool for constant-time algorithms. For any ε > 0, a partitioning oracle provides query access to a fixed partition of the input bounded-degree minor-free graph, in which every component has size poly(1/ε), and the number of edges removed is at most εn, where n is the number of vertices in the graph.
However, the oracle of Hassidim et al. makes an exponential number of queries to the input graph to answer every query about the partition. In this paper, we construct an efficient partitioning oracle for graphs with constant treewidth. The oracle makes only O(poly(1/ε)) queries to the input graph to answer each query about the partition.
Examples of bounded-treewidth graph classes include k-outerplanar graphs for fixed k, series-parallel graphs, cactus graphs, and pseudoforests. Our oracle yields poly(1/ε)-time property testing algorithms for membership in these classes of graphs. Another application of the oracle is a poly(1/ε)-time algorithm that approximates the maximum matching size, the minimum vertex cover size, and the minimum dominating set size up to an additive εn in graphs with bounded treewidth. Finally, the oracle can be used to test in poly(1/ε) time whether the input bounded-treewidth graph is k-colorable or perfect.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-22935-0_45
