Bridging gap between standard and differential polynomial approximation: The case of bin-packing
From MaRDI portal
DOI10.1016/S0893-9659(99)00112-3zbMATH Open0942.68144MaRDI QIDQ1961735FDOQ1961735
Authors: Marc Demange, Jérôme Monnot, Vangelis Th. Paschos 
Publication date: 30 January 2000
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Recommendations
- Maximizing the number of unused bins
- Differential approximation algorithms for some combinatorial optimization problems
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- A dense hierarchy of sublinear time approximation schemes for bin packing
- A Packing Problem You Can Almost Solve by Sitting on Your Suitcase
Cites Work
- Title not available (Why is that?)
- Bin packing can be solved within 1+epsilon in linear time
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Structure preserving reductions among convex optimization problems
- Differential approximation algorithms for some combinatorial optimization problems
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Title not available (Why is that?)
- Linear Programming in O([n3/ln n]L) Operations
- Fast algorithms for bin packing
- Non deterministic polynomial optimization problems and their approximations
- Approximating \(k\)-set cover and complementary graph coloring
- Title not available (Why is that?)
Cited In (11)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
- Differential approximation results for the traveling salesman and related problems
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances
- A better differential approximation ratio for symmetric TSP
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
- A survey on the structure of approximation classes
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
- The maximum \(f\)-depth spanning tree problem
- The maximum saving partition problem
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
- Differential approximation of NP-hard problems with equal size feasible solutions
This page was built for publication: Bridging gap between standard and differential polynomial approximation: The case of bin-packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961735)
