Bridging gap between standard and differential polynomial approximation: The case of bin-packing

Applied Mathematics Letters

Volumn 12, Issue 7, 1999, Pages 127-133

  Demange, M ^a,b   Monnot, J ^a   Paschos, V Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000785552     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(99)00112-3     Document Type: Article

References (16)

1. M.R. Garey and D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, CA, (1979).
2. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, (1981).
3. M. Demange and V.T. Paschos, On an approximation measure founded on the links between optimization and polynomial approximation theory, Theoret. Comput. Sci. 158, 117-141 (1996).
4. M. Demange, P. Grisoni and V.T. Paschos, Differential approximation algorithms for some combinatorial optimization problems, Theoret. Comput. Sci. (to appear).
5. G. Ausiello, A. D'Atri and M. Protasi, Structure preserving reductions among convex optimization problems, J. Comput. System Sci. 21, 136-153 (1980).
6. M.M. Halldórsson, Approximating k-set cover and complementary graph coloring, In Proc. International Integer Programming and Combinatorial Optimization Conference, Number 1084 in Lecture Notes in Computer Science, pp. 118-131, Springer-Verlag, (1996).
7. U. Feige and J. Kilian, Zero knowledge and the chromatic number, In Proc. Conference on Computational Complexity, pp. 278-287, (1996).
8. 1-∈, In Proc. FOCS '96, pp. 627-636, (1996).
9. J. Håstad, Testing on the long code and hardness for clique, In Proc. STOC '96, pp. 11-19, (1996).
10. R. Bar-Yehuda and S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Ann. Discrete Appl. Math. 25, 27-46 (1985).
11. D.S. Johnson, Fast algorithms for bin packing, J. Comput. System Sci. 8, 272-314 (1974).
12. D.S., Johnson, A. Demers, J.D. Ullman, M.R. Garey and R.L. Graham, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput. 3 (4), 298-325 (1974).
13. W. Fernandez de la Vega and G.S. Lueker, Bin packing can be solved within 1 + ∈ in linear time, Combinatorica 1 (4), 349-355 (1981).
14. J. Monnot, Familles d'instances critiques et approximation polynomiale, Ph.D. Thesis, LAMSADE, Université Paris-Dauphine (in preparation).
15. A. Paz and S. Moran, Nondeterministic polynomial optimization problems and their approximations, Theoret. Comput. Sci. 15, 251-277 (1981).
16. 3 / log n)L) operations, Discussion Paper 9746, CORE, Université Catholique de Louvain, (June 1997).