An approximation scheme for bin packing with conflicts

DOI10.1007/BFb0054353zbMath1502.90148OpenAlexW2105692312MaRDI QIDQ5054839

Klaus Jansen

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0054353

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Branch-and-cut for linear programs with overlapping SOS1 constraints ⋮ Approximation of the \(k\)-batch consolidation problem

Cites Work

• Approximation algorithms for time constrained scheduling
• An introduction to timetabling
• Bin packing can be solved within 1+epsilon in linear time
• Coloring inductive graphs on-line
• Mutual exclusion scheduling
• The χt-coloring problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation scheme for bin packing with conflicts