research-article

Free access

Geometry, flows, and graph-partitioning algorithms

Authors:

Sanjeev Arora,

Satish Rao,

Umesh VaziraniAuthors Info & Claims

Communications of the ACM, Volume 51, Issue 10

Pages 96 - 105

https://doi.org/10.1145/1400181.1400204

Published: 01 October 2008 Publication History

All formats PDF

References

[1]

Alon, N. Eigenvalues and expanders. Combinatorica, 6(2):83--96, 1986.

Digital Library

Google Scholar

[2]

Arora, S., Hazan, E., and Kale, S. O(\sqrt {\log n)}) approximation to sparsest cut in Õ(n ²) time. In FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pages 238--247, Washington, DC, USA, 2004. IEEE Computer Society.

Digital Library

Google Scholar

[3]

Arora, S., Hazan, E., and Kale, S. Multiplicative weights method: a meta-algorithm and its applications---a survey, 2005.

Google Scholar

[4]

Arora, S. and Kale, S. A combinatorial, primal-dual approach to semidefinite programs. In STOC '07: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pages 227--236, New York, NY, USA, 2007. ACM.

Digital Library

Google Scholar

[5]

Arora, S., Lee, J. R., and Naor, A. Euclidean distortion and the sparsest cut. J. Amer Math, Soc., 21(1):1--21 2008 (Electronic).

Google Scholar

[6]

Arora, S., Rao, S., and Vazirani, U. Expander flows, geometric embeddings and graph partitioning. In STOC '04: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pages 222--231, New York, NY, USA, 2004. ACM.

Digital Library

Google Scholar

[7]

Chawla, S., Gupta, A., and Raecke, H. Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In SODA '05: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms. pages 102--111, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.

Digital Library

Google Scholar

[8]

Cheeger, J. A lower bound for the smallest eigenvalue of the Laplacian. In Problem in Analysis, pages 195--199, 1970.

Google Scholar

[9]

Goemans, M. X. Semidefinite programming and combinatorial optimization. In Proceedings of the International Congress of Mathematicians, Vol. Ill (Berlin, 1998), pages 657--666,1998 (electronic).

Google Scholar

[10]

Goemans, M. X. and Williamson, D. P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach., 42(6):1115--1145, 1995.

Digital Library

Google Scholar

[11]

Karypis, G. and Kumar, V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Scientific Comput., 20(l):359--392, 1998.

Digital Library

Google Scholar

[12]

Khandekar, R., Rao, S., and Vazirani, U. Graph partitioning using single commodity flows. In STOC '06: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pages 385--390, New York, NY, USA, 2006. ACM Press.

Digital Library

Google Scholar

[13]

Lee, J. R. On distance scales, embeddings, and efficient relaxations of the cut cone. In SODA '05: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 92--101, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics.

Digital Library

Google Scholar

[14]

Leighton, T. and Rao, S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM (JACM), 46(6):787--832, 1999.

Digital Library

Google Scholar

[15]

Linial, N., London, E., and Rabinovich, Y. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215--245, 1995.

Crossref

Google Scholar

[16]

Orecchia, L., Schulman, L. Vazirani U., and Vishnoin, N. On partitioning graphs via single commodity flows. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17--20, 2008. pages 461--470, 2008.

Digital Library

Google Scholar

[17]

Shmoys, D. S. Cut problems and their application to divide and conquer. In D. S. Hochbaum, ed., Approximation Algorithms for NP-Hard Problems. PWS Publishing, 1995.

Digital Library

Google Scholar

[18]

Sinclair, A. and Jerrum, M. Approximate counting, uniform generation and rapidly mixing Markov chains (extended abstract). In Graph-Theoretic Concepts in Computer Science (Staffelstein, 1987), volume 314 of Lecture Notes in Comput. Sci., pages 134--148, Berlin, 1988. Springer.

Digital Library

Google Scholar

Cited By

View all

Boyd ZFraiman NMarzuola JMucha POsting B(2024)An Escape Time Formulation for Subgraph Detection and Partitioning of Directed GraphsSIAM Journal on Matrix Analysis and Applications10.1137/23M155379045:1(685-711)Online publication date: 26-Feb-2024
https://doi.org/10.1137/23M1553790
Taştan AMuma MZoubir A(2024)Fast and Robust Sparsity-Aware Block Diagonal RepresentationIEEE Transactions on Signal Processing10.1109/TSP.2023.334356572(305-320)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TSP.2023.3343565
Hayashi M(2024)Bridge-Rhombus Transformation to Solve Partitioning Problem in Telecommunications Network2024 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)10.1109/ITC-CSCC62988.2024.10628414(1-6)Online publication date: 2-Jul-2024
https://doi.org/10.1109/ITC-CSCC62988.2024.10628414
Show More Cited By

Index Terms

Geometry, flows, and graph-partitioning algorithms
1. Theory of computation

Recommendations

Computational geometry algorithms library
SIGGRAPH ASIA '09: ACM SIGGRAPH ASIA 2009 Courses

The CGAL C++ library offers geometric data structures and algorithms that are reliable, efficient, easy to use, and easy to integrate in existing software. Use of de facto standard libraries like CGAL increases productivity, because they allow software ...
Geometry images
SIGGRAPH '02: Proceedings of the 29th annual conference on Computer graphics and interactive techniques

Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, which has advantages for many graphics applications. However, current ...
Geometry compression using spherical wavelet
ICAT'06: Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence

This paper proposed a novel geometry compression method using spherical wavelet. Given a manifold triangle mesh with zero genus and arbitrary topology, it is globally parameterized over the unit sphere S2 in E3 firstly. At the same time, by subdividing ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 51, Issue 10

October 2008

130 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/1400181

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 2008

Published in CACM Volume 51, Issue 10

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Popular
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

31
Total Citations
View Citations
6,106
Total Downloads

Downloads (Last 12 months)326
Downloads (Last 6 weeks)17

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Boyd ZFraiman NMarzuola JMucha POsting B(2024)An Escape Time Formulation for Subgraph Detection and Partitioning of Directed GraphsSIAM Journal on Matrix Analysis and Applications10.1137/23M155379045:1(685-711)Online publication date: 26-Feb-2024
https://doi.org/10.1137/23M1553790
Taştan AMuma MZoubir A(2024)Fast and Robust Sparsity-Aware Block Diagonal RepresentationIEEE Transactions on Signal Processing10.1109/TSP.2023.334356572(305-320)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1109/TSP.2023.3343565
Hayashi M(2024)Bridge-Rhombus Transformation to Solve Partitioning Problem in Telecommunications Network2024 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC)10.1109/ITC-CSCC62988.2024.10628414(1-6)Online publication date: 2-Jul-2024
https://doi.org/10.1109/ITC-CSCC62988.2024.10628414
Ayall TLiu HZhou CSeid AGereme FAbishu HYacob Y(2022)Graph Computing Systems and Partitioning Techniques: A SurveyIEEE Access10.1109/ACCESS.2022.321942210(118523-118550)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3219422
Taştan AMuma MZoubir A(2021)Sparsity-aware robust community detection (SPARCODE)Signal Processing10.1016/j.sigpro.2021.108147187(108147)Online publication date: Oct-2021
https://doi.org/10.1016/j.sigpro.2021.108147
Yuan ZHesamzadeh M(2019)A Modified Benders Decomposition Algorithm to Solve Second-Order Cone AC Optimal Power FlowIEEE Transactions on Smart Grid10.1109/TSG.2017.277640710:2(1713-1724)Online publication date: Mar-2019
https://doi.org/10.1109/TSG.2017.2776407
Withanage CLakmal DHansini MKankanamge KWitharanage YThayasivam U(2019)A modified multilevel k-way partitioning algorithm for trip-based road networksMATEC Web of Conferences10.1051/matecconf/201927201038272(01038)Online publication date: 13-Mar-2019
https://doi.org/10.1051/matecconf/201927201038
Priyadarshini SRodda S(2019)Geometric Multi-Way Frequent Subgraph Mining Approach to a Single Large DatabaseSmart Intelligent Computing and Applications10.1007/978-981-32-9690-9_23(233-244)Online publication date: 4-Oct-2019
https://doi.org/10.1007/978-981-32-9690-9_23
Kayaaslan ELambert TMarchal LUçar B(2018)Scheduling series-parallel task graphs to minimize peak memoryTheoretical Computer Science10.1016/j.tcs.2017.09.037707(1-23)Online publication date: Jan-2018
https://doi.org/10.1016/j.tcs.2017.09.037
Bianchi FMaiorino ELivi LRizzi ASadeghian A(2017)An agent-based algorithm exploiting multiple local dissimilarities for clusters mining and knowledge discoverySoft Computing - A Fusion of Foundations, Methodologies and Applications10.5555/3057124.305714721:5(1347-1369)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.5555/3057124.3057147
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Get Access

Login options

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

References

Cited By

Index Terms

Recommendations

Computational geometry algorithms library

Geometry images

Geometry compression using spherical wavelet

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Funding Sources

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations