A fast approximation algorithm for the multicovering problem
Discrete Applied Mathematics
The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Complexity and security of distributed protocols
Complexity and security of distributed protocols
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
Rounding algorithms for covering problems
Mathematical Programming: Series A and B
On budget-constrained flow improvement
Information Processing Letters
Buy-at-bulk network design: approximating the single-sink edge installation problem
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Network Models in Optimization and Their Applications in Practice
Network Models in Optimization and Their Applications in Practice
Network Design Using Cut Inequalities
SIAM Journal on Optimization
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
INFORMS Journal on Computing
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
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
An Approximation Algorithm for Minimum-Cost Network Design
An Approximation Algorithm for Minimum-Cost Network Design
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth 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
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
Asking the right questions: model-driven optimization using probes
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Randomized competitive algorithms for generalized caching
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Infrastructure Leasing Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences
Approximating integer programs with positive right-hand sides
Information Processing Letters
An improved approximation algorithm for vertex cover with hard capacities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Primal-dual schema for capacitated covering problems
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
How to probe for an extreme value
ACM Transactions on Algorithms (TALG)
A constant factor approximation algorithm for generalized min-sum set cover
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for diversified search ranking
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Approximability of capacitated network design
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Fixed-charge transportation on a path: linear programming formulations
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
On capacitated set cover problems
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 min-sum single-machine scheduling problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Submodular integer cover and its application to production planning
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Stochastic covering and adaptivity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
On column-restricted and priority covering integer programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
Approximating sparse covering integer programs online
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Minimum latency submodular cover
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
ACM Journal on Emerging Technologies in Computing Systems (JETC)
An approximation algorithm for the general mixed packing and covering problem
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Fractional routing using pairs of failure-disjoint paths
Discrete Applied Mathematics
| Hi-index | 0.00 |