Isoperimetric numbers of graphs
Journal of Combinatorial Theory Series B
Faster algorithms for finding small edge cuts in planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Finding minimum-quotient cuts in planar graphs
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Finding Separator Cuts in Planar Graphs within Twice the Optimal
SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Algorithms
A Polylogarithmic Approximation of the Minimum Bisection
SIAM Journal on Computing
Efficient Approximation for Triangulation of Minimum Treewidth
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Multi-objective circuit partitioning for cutsize and path-based delay minimization
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Throughput-driven synthesis of embedded software for pipelined execution on multicore architectures
ACM Transactions on Embedded Computing Systems (TECS)
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We devise the first constant factor approximation algorithm for minimum quotient vertex-cuts in planar graphs. Our algorithm achieves approximation ratio 1+4/3(1+ε) with running time O(W• n3+2/ε), where W is the total weight of the vertices. The approximation ratio improves to 4/3(1+ε+o(1)) if there is an optimal quotient vertex-cut (A*,B*,C*) where the weight of C* is of low order compared to those of A* and B*; this holds, for example, when the input graph has uniform weights and costs. The ratio further improves to 1+ε+o(1) if, in addition, min[w(A*),w(B*)] ≤ 1/3 W.We use our algorithm for quotient vertex-cuts to achieve the first constant-factor pseudo-approximation for vertex separators in planar graphs.Our technical contribution is two-fold. First, we prove a structural theorem for planar graphs, showing the existence of a near-optimal quotient vertex-cut whose high-level structure is that of a bounded-depth tree. Second, we develop an algorithm that optimizes over such complex structures in running time that depends (exponentially) not on the size of the structure, but rather only on its depth. These techniques may be applicable in other problems.