On-line and off-line approximation algorithms for vector covering problems
From MaRDI portal
Publication:1386465
DOI10.1007/PL00009203zbMath0896.68068MaRDI QIDQ1386465
Arjen P. A. Vestjens, Noga Alon, Gerhard J. Woeginger, Leah Epstein, Yossi Azar, János A. Csirik, Sergey Sevast'janov
Publication date: 1 October 1998
Published in: Algorithmica (Search for Journal in Brave)
Related Items (11)
There is no asymptotic PTAS for two-dimensional vector packing ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ There is no APTAS for 2-dimensional vector bin packing: revisited ⋮ Bin covering with cardinality constraints ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory ⋮ Unnamed Item ⋮ On the sum minimization version of the online bin covering problem ⋮ Lower bounds for online bin covering-type problems ⋮ Online variable sized covering
This page was built for publication: On-line and off-line approximation algorithms for vector covering problems
