Article

Free access

Finding near-optimal cuts: an empirical evaluation

Authors:

Satish RaoAuthors Info & Claims

SODA '93: Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms

Pages 212 - 221

Published: 01 January 1993 Publication History

First page of PDF

References

[1]

A. Agr~wal ~nd P. Klein. Cutting down on fill using nested dissection: Provably good elimination orderings. In A. George, J. Gilbert, and J. Liu, editors, Sparse Matrix Computations: Graph Theory Issues and Algorithms, IMA Volumes in Mathematics and Its Applications. Springer-Verlag, New York. To appear.

[2]

S.N. Bhatt and F.T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28(2), 1984.

[3]

H. L. Bodlaender, J.R. Gilbert, H. Hafsteinsson, and T. Kloks. Planar embeddings of planar graphs. Technical report, Xerox Corporation, Palo Alto Research Center, 1990.

[4]

R. Boppan~. Eigenvalues and graph bisection: An average case analysis. In ~Sth Annual Symposium on Foundations of Computer Science, IEEE, page 280, 1987.

[5]

T. Bui, S. Chaudhuri, F.T. Leighton, and M. Sipser. Graph bisection algorithms with good average case behavior. In FOCS, pages 181-192, 1984.

[6]

W.E. Donath and A.J. Hoffman. Lower bounds for the partitioning of graphs. IBM Journal of Res. Develop., pages 420-425, September 1973.

[7]

C.M. Fiduccia and R.M. Mattheyses. A linear time heuristic for improving network partitions. In Design Automation Conference, pages 175-181, 1982.

Digital Library

[8]

A. Goldberg. A natural randomization strategy for multicommodity flow and related algorithms. Unpublished Manuscript.

[9]

L. Hagen and Andrew B. Kahng. New spectral methods ratio cut partitioning and clustering. IEEE Trans. actions on Computer-Aided Design, 11(9):1074-1085, September 1992.

[10]

M. Hansen. Approximation algorithms for geometric embeddings in the plane and applications to parallel processing problems. In Proceedings of the 30th An. nual Symposium on Foundations of Computer Science. IEEE, October 1989.

[11]

D. S. Johnson, C.R. Aragon, and L.A. McGeoch nd C. Schevon. Oprimization by simulated annealing: An experimental evaluation; part 1, graph partitioning. Operations Research, 37(6):865-892, 1989.

Digital Library

[12]

N. Kahale. Unpublished manuscript.

[13]

B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Tech. Journal, pages 291-307, February 1970.

[14]

S. Kirkpatrick. Optimization by simulated annealing. J. Statis. Phy, 34:975-986, 1984.

[15]

P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. In Proceedings of the ~~nd Annual A CM Symposium on Theory of Computing, pages 310-321, May 1990.

Digital Library

[16]

P. N. Klein, J. M. Borger, and S. Kang. Approximating concurrent flow with uniform demands and capacities: an implementation, in Proceedings of DIMACS implementation Challenge Workshop: Network Flows and Matching, October 1991.

[17]

F. T. Leighton and Satish Rao. An approximate max-flow rain-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. Unpublished Manuscript.

[18]

F. T. Leighton and Satish Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In ~Sth Annual Symposium on Foundations of Computer Science, IEEE, pages 256-269, 1988.

[19]

F.T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. In Proceedings of the ~Jrd Annual A CM Symposium on Theory of Computing, pages 101-111, May 1991.

Digital Library

[20]

T. Leong, P. Shot, and C. Stein. Implementation of a combinatorial multicommodity flow algorithm. In Proceedings of DIMA CS Implementation Challenge Workshop: Network Flows and Matching, October 1991.

[21]

R.J. Lipton and R.E. Tarjan. Applications of a planat separator theorem. SIAM Journal on Computing, 36(2):177-189, April 1979.

[22]

R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM Journal of Applied Mathematics, 8(2):177-189, April 1979.

[23]

D.W. Matula and F. Shahrokhi. The maximum concurrent flow problem and sparsest cuts. Technical report, Southern Methodist University, March 1986.

[24]

D. Plaisted. A heuristic algorithm for small separators in arbitrary graphs. SIAM Journal on Computing, 19(2):267-280, April 1990.

Digital Library

[25]

S. Plotkin. Personal Communication.

[26]

R.C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389- 1401, 1957.

[27]

R. Ravi and P. Agrawal, A.and Klein. Ordering problems approximated:single-processor scheduling and interval graph completion. In Proceedings of the ICALP Conference, 1991.

Digital Library

[28]

C. Sechen and K. W. Lee. An improved simulated annealing algorithm for row-based placement. In Proceed. ings of the IEEE Int. Confernce on Computer-Aided Design, pages 478-481, November 1987.

[29]

F. Shahrokhi and D.W. Matula. The maximum concurrent flow problem. Journal of the A CM, 37:318-334, 1990.

Digital Library

[30]

W. Swartz and C. Sechen. New algorithms for the placement and routing of macro cells. In Proceedings of the IEEE Int. Confernce on Computer. Aided Design, pages 336-339, November 1990.

[31]

S. Tragoudas. Personal Communication.

[32]

Y. C. Wei and C. K. Cheng. Towards efficient heirarchical designs by ratio cut partitioning, in Proceedings of the IEEE Int. Confernce on Computer. Aided Design, pages 298-301, 1989.

[33]

Y. C. Wei and C. K. Cheng. Towards efficient heirarchical designs by ratio cut partitioning. In Proceedings of the IEEE Int. Confernce on Computer. Aided Design, pages 516 -519, 1990.

[34]

Y. C. Wei and C. K. Cheng. Ratio cut partitioning for heirarchical designs. IEEE Transactions on Computer. Aided Design, 10:911-921, July 1991.

[35]

Y. C. Wei and C. K. Cheng. Towards efficient heirarchical designs by ratio cut partitioning. In Proceedings of the IEEE Int. Confernce on Computer-Aided Design, page To appear, 1992.

Cited By

Leskovec JLang KMahoney MRappa MJones PFreire JChakrabarti S(2010)Empirical comparison of algorithms for network community detectionProceedings of the 19th international conference on World wide web10.1145/1772690.1772755(631-640)Online publication date: 26-Apr-2010
https://dl.acm.org/doi/10.1145/1772690.1772755
Khandekar RRao SVazirani U(2009)Graph partitioning using single commodity flowsJournal of the ACM10.1145/1538902.153890356:4(1-15)Online publication date: 2-Jul-2009
https://dl.acm.org/doi/10.1145/1538902.1538903
Lang KMahoney MOrecchia L(2009)Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and FlowProceedings of the 8th International Symposium on Experimental Algorithms10.1007/978-3-642-02011-7_19(197-208)Online publication date: 4-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02011-7_19
Show More Cited By

Index Terms

Finding near-optimal cuts: an empirical evaluation
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
  2. Randomness, geometry and discrete structures

Recommendations

Algorithms for ham-sandwich cuts

Given disjoint setsP1,P2, ...,Pd inRd withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects thePi. We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having ...
Minimum cuts in near-linear time

We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We ...
Near-Optimal Time-Space Tradeoff for Element Distinctness

It was conjectured in Borodin et al. [J. Comput. System Sci., 22 (1981), pp. 351--364] that to solve the element distinctness problem requires $TS = \Omega(n^2)$ on a comparison-based branching program using space $S$ and time $T$, which, if true, would ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SODA '93: Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms

January 1993

506 pages

ISBN:0898713137

Chairman:
Vijaya Ramachandran

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM: Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1993

Check for updates

Qualifiers

Article

Conference

SODA93

Sponsor:

SIGACT
SIAM

SODA93: Conference on Discrete Algorithms

January 25 - 27, 1993

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
473
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)13

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Leskovec JLang KMahoney MRappa MJones PFreire JChakrabarti S(2010)Empirical comparison of algorithms for network community detectionProceedings of the 19th international conference on World wide web10.1145/1772690.1772755(631-640)Online publication date: 26-Apr-2010
https://dl.acm.org/doi/10.1145/1772690.1772755
Khandekar RRao SVazirani U(2009)Graph partitioning using single commodity flowsJournal of the ACM10.1145/1538902.153890356:4(1-15)Online publication date: 2-Jul-2009
https://dl.acm.org/doi/10.1145/1538902.1538903
Lang KMahoney MOrecchia L(2009)Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and FlowProceedings of the 8th International Symposium on Experimental Algorithms10.1007/978-3-642-02011-7_19(197-208)Online publication date: 4-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02011-7_19
Khandekar RRao SVazirani UKleinberg J(2006)Graph partitioning using single commodity flowsProceedings of the thirty-eighth annual ACM symposium on Theory of Computing10.1145/1132516.1132574(385-390)Online publication date: 21-May-2006
https://dl.acm.org/doi/10.1145/1132516.1132574
Freivalds K(2003)A nondifferentiable optimization approach to ratio-cut partitioningProceedings of the 2nd international conference on Experimental and efficient algorithms10.5555/1764149.1764160(134-147)Online publication date: 26-May-2003
https://dl.acm.org/doi/10.5555/1764149.1764160
Fu ZVenkatasubramanian NBuford JStevens SBulterman DJeffay KZhang H(1999)Combined path and server selection in dynamic multimedia environmentsProceedings of the seventh ACM international conference on Multimedia (Part 1)10.1145/319463.319687(469-472)Online publication date: 30-Oct-1999
https://dl.acm.org/doi/10.1145/319463.319687
Even GNaor JRao SSchieber BSaks M(1997)Fast approximate graph partitioning algorithmsProceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms10.5555/314161.314405(639-648)Online publication date: 5-Jan-1997
https://dl.acm.org/doi/10.5555/314161.314405
Kuo MCheng CYoffa EDe Micheli GRabaey J(1997)A network flow approach for hierarchical tree partitioningProceedings of the 34th annual Design Automation Conference10.1145/266021.266269(512-517)Online publication date: 13-Jun-1997
https://dl.acm.org/doi/10.1145/266021.266269
Ma QSteenkiste PZhang H(1996)Routing high-bandwidth traffic in max-min fair share networksACM SIGCOMM Computer Communication Review10.1145/248157.24817526:4(206-217)Online publication date: 28-Aug-1996
https://dl.acm.org/doi/10.1145/248157.248175
Ma QSteenkiste PZhang HEstrin DFloyd SPartridge C(1996)Routing high-bandwidth traffic in max-min fair share networksConference proceedings on Applications, technologies, architectures, and protocols for computer communications10.1145/248156.248175(206-217)Online publication date: 28-Aug-1996
https://dl.acm.org/doi/10.1145/248156.248175
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents