Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved approximations of packing and covering problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On linear potential functions for approximating Bayesian computations
Journal of the ACM (JACM)
Minimum cuts in near-linear 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
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
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast approximation algorithm for minimum cost multicommodity flow
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the greedy heuristic for matchings
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Minimum cuts in near-linear time
Journal of the ACM (JACM)
&egr;-Approximate linear programs: new bounds and computation
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Fast approximate probabilistically checkable proofs
Information and Computation
Stochastic Networks: Admission and Routing Using Penalty Functions
Queueing Systems: Theory and Applications
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A generic flow algorithm for shared filter ordering problems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rank minimization via online learning
Proceedings of the 25th international conference on Machine learning
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
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
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Proceedings of the 12th ACM conference on Electronic commerce
Linear programming in the semi-streaming model with application to the maximum matching problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the complexity of solving Markov decision problems
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
An incremental model for combinatorial maximization problems
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Fractional matching via balls-and-bins
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Sublinear optimization for machine learning
Journal of the ACM (JACM)
Fast asymptotic FPTAS for packing fragmentable items with costs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation
A distributed algorithm for large-scale generalized matching
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Fast algorithms that find approximate solutions for a general class of problems, which are called fractional packing and covering problems, are presented. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed greatly outperform the general methods in many applications, and are extensions of a method previously applied to find approximate solutions to multicommodity flow problems. The algorithms are based on a Lagrangian relaxation technique, and an important result is a theoretical analysis of the running time of a Lagrangian relaxation based algorithm. Several applications of the algorithms are presented.