Finding separator cuts in planar graphs within twice the optimal

Authors:
N. Garg;H. Saran;V. V. Vazirani
Affiliations:
Dept. of Comput. Sci.&Eng., Indian Inst. of Technol., New Delhi, India;Dept. of Comput. Sci.&Eng., Indian Inst. of Technol., New Delhi, India;Dept. of Comput. Sci.&Eng., Indian Inst. of Technol., New Delhi, India
Venue:
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Year:
1994

Citing 0
Cited 2

Balanced cut approximation in random geometric graphs

Theoretical Computer Science
Balanced cut approximation in random geometric graphs

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Building on the works of S.B. Rao (1987, 1992) and J.K. Park and C.A. Phillips (1993), we present a factor 2 approximation algorithm for the problem of finding a minimum cost b-balanced cut in planar graphs, for b/spl les/1/3, if the vertex weights are given in unary (using scaling, a psuedo-approximation algorithm is also presented for the case of binary vertex weights). This problem is of considerable practical significance, especially in VLSI design.