Faster and simpler approximation algorithms for mixed packing and covering problems
From MaRDI portal
Publication:884474
DOI10.1016/J.TCS.2007.02.064zbMATH Open1115.68172OpenAlexW2155224464MaRDI QIDQ884474FDOQ884474
Authors: Florian Diedrich, Klaus Jansen 
Publication date: 6 June 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.064
Recommendations
optimizationapproximation algorithmlogarithmic potentialLagrangian decompositionlinear and convex programmingpacking and covering problem
Cites Work
- Approximate max-min resource sharing for structured concave optimization
- Title not available (Why is that?)
- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
- Title not available (Why is that?)
- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- An approximation algorithm for the general max-min resource sharing problem
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
- Coordination Complexity of Parallel Price-Directive Decomposition
- Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem
- Title not available (Why is that?)
- Experimental and Efficient Algorithms
- An Approximation Algorithm for the General Mixed Packing and Covering Problem
- Approximation Algorithm for the Mixed Fractional Packing and Covering Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing and Combinatorics
- A fast approximation scheme for fractional covering problems with variable upper bounds
Cited In (15)
- Approximation Algorithm for the Mixed Fractional Packing and Covering Problem
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs
- Unified acceleration method for packing and covering problems via diameter reduction
- Black-box acceleration of monotone convex program solvers
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- Title not available (Why is that?)
- An Approximation Algorithm for the General Mixed Packing and Covering Problem
- Cover and pack inequalities for (mixed) integer programming
- Pseudo-polynomial time algorithms for combinatorial food mixture packing problems
- Title not available (Why is that?)
- Faster fixed-parameter tractable algorithms for matching and packing problems
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs
- Packing trees in communication networks
- Approximation and Online Algorithms
This page was built for publication: Faster and simpler approximation algorithms for mixed packing and covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884474)
