Bridging gap between standard and differential polynomial approximation: The case of bin-packing
From MaRDI portal
Publication:1961735
DOI10.1016/S0893-9659(99)00112-3zbMath0942.68144MaRDI QIDQ1961735
Jérôme Monnot, Marc Demange, Vangelis Th. Paschos
Publication date: 30 January 2000
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Related Items (11)
Differential approximation results for the traveling salesman and related problems ⋮ Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation ⋮ A survey on the structure of approximation classes ⋮ A better differential approximation ratio for symmetric TSP ⋮ Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) ⋮ New differential approximation algorithm for \(k\)-customer vehicle routing problem ⋮ Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness ⋮ The maximum saving partition problem ⋮ Differential approximation of NP-hard problems with equal size feasible solutions ⋮ Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances ⋮ The maximum \(f\)-depth spanning tree problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structure preserving reductions among convex optimization problems
- Non deterministic polynomial optimization problems and their approximations
- Bin packing can be solved within 1+epsilon in linear time
- Differential approximation algorithms for some combinatorial optimization problems
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- Fast algorithms for bin packing
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Approximating k-set cover and complementary graph coloring
- Linear Programming in O([n3/ln nL) Operations]
This page was built for publication: Bridging gap between standard and differential polynomial approximation: The case of bin-packing
