Work

Geometry, flows, and graph-partitioning algorithms

Year: 2008

Type: article

Source: Communications of the ACM

DOI: 10.1145/1400181.1400204

Authors: Sanjeev Arora, Satish Rao, Umesh Vazirani

Institutions: Princeton University, University of California, Berkeley

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funders: National Science Foundation, Division of Computing and Communication Foundations

Awards: G3853726932, Collaborative Research: MSPA-MCS: Embeddings of Finite Metric Spaces - A Geometric Approach to Efficient Algorithms

OpenAlex ID: W2163175782

FWCI: 4.398

Cites: 24

Cited by: 41

Related to: 10