Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A primal-dual schema based approximation algorithm for the element connectivity problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The prize collecting Steiner tree problem: theory and practice
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A primal-dual schema based approximation algorithm for the element connectivity problem
Journal of Algorithms
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
Discrete Applied Mathematics
Primal-dual schema based approximation algorithms
Theoretical aspects of computer science
A Min-Max Theorem on Feedback Vertex Sets
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Primal-dual approaches to the Steiner problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Primal-Dual Schema Based Approximation Algorithms
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Fast Algorithms for Even/Odd Minimum Cuts and Generalizations
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Information Processing Letters
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Reconstructing a simple polytope from its graph
Combinatorial optimization - Eureka, you shrink!
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
Discrete Applied Mathematics
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
Strong lower bounds for the prize collecting Steiner problem in graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Primal-dual approach for directed vertex connectivity augmentation and generalizations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
Bottleneck links, variable demand, and the tragedy of the commons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
Computers and Operations Research
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Computational Optimization and Applications
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Shared distribution of digital products using multicast
Electronic Commerce Research and Applications
Network design for vertex connectivity
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximating Directed Weighted-Degree Constrained Networks
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Discrete Applied Mathematics
Minimum-weight cycle covers and their approximability
Discrete Applied Mathematics
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Approximation Algorithms for a Network Design Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
Computers and Operations Research
A distributed primal-dual heuristic for steiner problems in networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Approximating Steiner networks with node weights
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Covering a laminar family by leaf to leaf links
Discrete Applied Mathematics
Set connectivity problems in undirected graphs and the directed steiner network problem
ACM Transactions on Algorithms (TALG)
Approximating directed weighted-degree constrained networks
Theoretical Computer Science
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
SIAM Journal on Computing
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Primal-dual approximation algorithms for node-weighted steiner forest on planar graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
A primal-dual approximation algorithm for the vertex cover P3 problem
Theoretical Computer Science
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Performance tuning of matrix triple products based on matrix structure
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Submodular integer cover and its application to production planning
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Rectangle covers revisited computationally
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Theoretical Computer Science
Network design with edge-connectivity and degree constraints
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Reconfigurations in graphs and grids
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Hitting diamonds and growing cacti
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
Algorithmic expedients for the Prize Collecting Steiner Tree Problem
Discrete Optimization
Local ratio with negative weights
Operations Research Letters
Brief announcement: live streaming with utilities, quality and cost
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Node-weighted network design in planar and minor-closed families of graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A dual-fitting 3/2-approximation algorithm for some minimum-cost graph problems
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Information and Computation
Approximating infeasible 2VPI-systems
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
Discrete Applied Mathematics
| Hi-index | 0.00 |