The maximum f-depth spanning tree problem

Information Processing Letters

Volumn 80, Issue 4, 2001, Pages 179-187

  Monnot, Jérôme ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Analysis of algorithms; Approximate algorithms; Differential ratio; Performance ratio; Reductions

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; DIFFERENTIATION (CALCULUS); POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

DIFFERENTIAL RATIO;

TREES (MATHEMATICS);

EID: 0035976396     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00160-0     Document Type: Article

References (27)

1. Approximating the minimum rooted spanning tree with depth two
2. Approximate solutions of NP-optimization problems
3. Structure preserving reductions among convex optimization problems
4. Cost-sensitive analysis of communication protocols
5. The Steiner problem with edge lengths 1 and 2
6. Completness in approximation classes
7. Differential approximation algorithms for some combinatorial optimization problems
8. Bridging gap between standard and differential polynomial approximation: The case of bin-packing
9. On an approximation measure founded on the links between optimization and polynomial approximation theory
10. An explicit lower bound for TSP with distances one and two
11. An analysis of approximations for finding a maximum weight Hamiltonian circuit
12. Computers and Intractability. A Guide to the Theory of NP-Completeness
13. Multicommodity flow models for spanning tree with hop constraints
14. Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with Hop constraints
15. Designing reliable tree with two cable technologies
16. Approximating k-set cover and complementary graph coloring
17. Balancing minimum spanning and shortest paths trees
18. Approximating shallow-light trees
19. Some approximation results in multicasting
20. Bicriteria network design problems
21. Improved approximations for shallow-light spanning trees
22. On approximation preserving reductions: Complete problems and robust measures
23. The traveling salesman problem with distance one and two