Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
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
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
Discrete Applied Mathematics
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms (TALG)
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Discrete Applied Mathematics
The complexity of finding subgraphs whose matching number equals the vertex cover number
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Multicommodity flows and cuts in polymatroidal networks
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Approximation algorithms for requirement cut on graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Approximation algorithm for directed multicuts
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
An improved approximation algorithm for requirement cut
Operations Research Letters
| Hi-index | 0.00 |