When trees collide: an approximation algorithm for the generalized Steiner problem on networks
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n2) Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection
The Journal of Machine Learning Research
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Preconditioning Lanczos Approximations to the Matrix Exponential
SIAM Journal on Scientific Computing
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
COLT'06 Proceedings of the 19th annual conference on Learning Theory
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Online kernel PCA with entropic matrix updates
Proceedings of the 24th international conference on Machine learning
Proceedings of the 24th international conference on Machine learning
On partitioning graphs via single commodity flows
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Geometry, flows, and graph-partitioning algorithms
Communications of the ACM
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Finding sparse cuts locally using evolving sets
Proceedings of the forty-first annual ACM symposium on Theory of computing
Max cut and the smallest eigenvalue
Proceedings of the forty-first annual ACM symposium on Theory of computing
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
A new diffusion-based multilevel algorithm for computing graph partitions
Journal of Parallel and Distributed Computing
Graph partitioning and disturbed diffusion
Parallel Computing
An SDP primal-dual algorithm for approximating the Lovász-theta function
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
When is there a free matrix lunch?
COLT'07 Proceedings of the 20th annual conference on Learning theory
Proceedings of the forty-second ACM symposium on Theory of computing
Approximations for the isoperimetric and spectral profile of graphs and related parameters
Proceedings of the forty-second ACM symposium on Theory of computing
Communications of the ACM
Fast SDP algorithms for constraint satisfaction problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Journal of the ACM (JACM)
Approximating Semidefinite Packing Programs
SIAM Journal on Optimization
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The laplacian paradigm: emerging algorithms for massive graphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Feasible and accurate algorithms for covering semidefinite programs
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Metric and kernel learning using a linear transformation
The Journal of Machine Learning Research
Faster approximate multicommodity flow using quadratically coupled flows
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A matrix hyperbolic cosine algorithm and applications
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.03 |
Semidefinite programs (SDP) have been used in many recentapproximation algorithms. We develop a general primal-dualapproach to solve SDPs using a generalization ofthe well-known multiplicative weights update rule to symmetricmatrices. For a number of problems, such as Sparsest Cut and Balanced Separator in undirected and directed weighted graphs, and the Min UnCut problem, this yields combinatorial approximationalgorithms that are significantly more efficient than interiorpoint methods. The design of our primal-dual algorithms is guidedby a robust analysis of rounding algorithms used to obtain integersolutions from fractional ones.