Approximating Bin Packing with Conflict Graphs via Maximization Techniques
From MaRDI portal
Publication:6496551
DOI10.1007/978-3-031-43380-1_19MaRDI QIDQ6496551FDOQ6496551
Ilan Doron-Arad, Hadas Shachnai
Publication date: 3 May 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tight approximation algorithms for maximum separable assignment problems
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Bin packing can be solved within 1+epsilon in linear time
- Geometric algorithms and combinatorial optimization.
- Algorithmic graph theory and perfect graphs
- On Bin Packing with Conflicts
- Linear degree extractors and the inapproximability of max clique and chromatic number
- An approximation scheme for bin packing with conflicts
- The Knapsack Problem with Conflict Graphs
- Approximation algorithms for time constrained scheduling
- A still better performance guarantee for approximate graph coloring
- All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
- An APTAS for bin packing with clique-graph conflicts
- Distributed Approximation Algorithm for Resource Clustering
- A Logarithmic Additive Integrality Gap for Bin Packing
Cited In (1)
This page was built for publication: Approximating Bin Packing with Conflict Graphs via Maximization Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496551)
