An Approximation Algorithm for the General Mixed Packing and Covering Problem

DOI10.1007/978-3-540-74450-4_12zbMath1176.90490OpenAlexW1587168891MaRDI QIDQ3611903

Florian Diedrich, Klaus Jansen

Publication date: 3 March 2009

Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_12

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (1)

Faster and simpler approximation algorithms for mixed packing and covering problems

This page was built for publication: An Approximation Algorithm for the General Mixed Packing and Covering Problem