A combinatorial algorithm for computing a maximum independent set in a t-perfect graph
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Hitting sets when the VC-dimension is small
Information Processing Letters
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
Combinatorial approaches to QoS scheduling in multichannel infrastructure wireless networks
WICON '06 Proceedings of the 2nd annual international workshop on Wireless internet
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed network monitoring and multicommodity flows: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Minimizing the total cost of network measurements in a distributed manner: a primal-dual approach
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Semantic-Aware and QoS-Aware Image Caching in Ad Hoc Networks
IEEE Transactions on Knowledge and Data Engineering
The complexity of linear programming in (γ,κ)-form
Information Processing Letters
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Stateless distributed gradient descent for positive linear programs
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
An optimal local approximation algorithm for max-min linear programs
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Hitting sets when the VC-dimension is small
Information Processing Letters
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
Stateless near optimal flow control with poly-logarithmic convergence
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Polynomial-space approximation of no-signaling provers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Mathematics of Operations Research
Lower bounds for maximum parsimony with gene order data
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for mixed fractional packing and covering problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Competitive and deterministic embeddings of virtual networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Equivalence of two linear programming relaxations for broadcast scheduling
Operations Research Letters
Faster and simpler width-independent parallel algorithms for positive semidefinite programming
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
ACM Transactions on Algorithms (TALG)
Fast asymptotic FPTAS for packing fragmentable items with costs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
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
BonnRoute: Algorithms and data structures for fast and good VLSI routing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science
Efficient regression in metric spaces via approximate lipschitz extension
SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition
A distributed algorithm for large-scale generalized matching
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems).For explicitly given problems, our fastest sequential algorithm returns a solution satisfying all constraints within a 1 \pm \varepsilon factor in 0(md\log (m)/\varepsilon ^2 ) time, where m is the number of constraints and d is the maximum number of constraints any variable appears in.Our parallel algorithm runs in time polylogarithmic in the input size times \varepsilon ^4 and uses a total number of operations comparable to the sequential algorithm.The main contribution is that the algorithms solve mixed packing and covering problems (in contrast to pure packing or pure covering problems, which have only \leq or only \geq inequalities, but not both) and run in time independent of the so-called width of the problem.