Faster and simpler approximation algorithms for mixed packing and covering problems

From MaRDI portal
Publication:884474

DOI10.1016/j.tcs.2007.02.064zbMath1115.68172OpenAlexW2155224464MaRDI QIDQ884474

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




Related Items (4)



Cites Work


This page was built for publication: Faster and simpler approximation algorithms for mixed packing and covering problems