Master-slave strategy and polynomial approximation

Computational Optimization and Applications

Volumn 16, Issue 3, 2000, Pages 231-245

  Alfandari, Laurent ^a   Paschos, Vangelis Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTEGRATED CIRCUIT LAYOUT; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; VLSI CIRCUITS;

POLYNOMIAL APPROXIMATION THEORY;

APPROXIMATION THEORY;

EID: 0034272598     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008764212265     Document Type: Article

References (13)

1. L. Alfandari, "Approximation de problèmes de couverture et de partitionnement de graphes," PhD Thesis, LAMSADE, Université Paris-Dauphine.
2. L. Alfandari and V. Th. Paschos, "Approximating the minimum-weight rooted spanning tree with depth two," ITOR 6, 1999, pp. 607-622.
3. B.B. Boppana and M.M. Halldórsson, "Approximating maximum independent sets by excluding subgraphs," BIT, vol. 32, no. 2, pp. 180-196, 1992.
4. V. Chvátal, "A greedy-heuristic for the set covering problem," Math. of Oper. Res., vol. 4, pp. 233-235, 1979.
5. P. Crescenzi and A. Panconesi, "Completeness in approximation classes," in Lecture Notes in Computer Science, vol. 380: Proc. of Fundamentals of Computation Theory, Springer Verlag, 1989, pp. 116-126.
6. M.R. Garey and D.S. Johnson, "Computers and Intractability. A Guide to the Theory of NP-Completeness," W.H. Freeman: San Francisco, 1979.
7. D.S. Johnson, "Approximation algorithms for combinatorial problems," J. Comput. System Sci., vol. 9, pp. 256-278, 1974.
8. D.S. Johnson, "Worst-case behavior of graph-coloring algorithms," in Proc. South-Eastern Conference on Combinatorics, Graph Theory and Computing, 1974, p. 513-528.
9. J.B. Kruskal, "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. Amer. Math. Soc., vol. 7, no. 1, pp. 48-50, 1956.
10. M. Minoux, "Some combinatorial optimization problems from VLSI-design," in Research Seminar "Optimization", Université Paris I, 1991.
11. A. Panconesi and D. Ranjan, "Quantifiers and approximation," in Proc. STOC'90, 1990, pp. 446-456.
12. H.U. Simon, "On approximate solutions for combinatorial optimization problems," SIAM J. Disc. Math., vol. 3, no. 2, pp. 294-310, 1990.
13. P. Slavík, "A tight analysis of the greedy algorithm for set cover," in Proc. STOC'96, 1996, pp. 435-441.