Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Fast approximation algorithms for fractional packing and covering problems
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Optimal file sharing in distributed networks (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Randomized Approximation Algorithms in Combinatorial Optimization
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
An extension of the Lovász local lemma, and its applications to integer programming
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Web caching using access statistics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the Approximability of Interactive Knapsack Problems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Tree Layout for Internal Network Characterizations in Multicast Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
Two sensitivity theorems in fuzzy integer programming
Discrete Applied Mathematics
Adaptivity and approximation for stochastic packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Partial covering of hypergraphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tight approximability results for test set problems in bioinformatics
Journal of Computer and System Sciences
Primitives for workload summarization and implications for SQL
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Approximating the online set multicover problems via randomized winnowing
Theoretical Computer Science
A Θ( logn)-approximation for the set cover problem with set ownership
Information Processing Letters
Interference in cellular networks: the minimum membership set cover problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
Covering analysis of the greedy algorithm for partial cover
Algorithms and Applications
Stochastic covering and adaptivity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Approximation of the Quadratic Set Covering problem
Discrete Optimization
Fixed-parameter tractability of satisfying beyond the number of variables
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
| Hi-index | 0.00 |