The constrained minimum spanning tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1097, Issue , 1996, Pages 66-75

  Ravi, R ^a   Goemans, M X ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Adjacency relations; Approximation algorithm; Lagrangean relaxation; Minimum spanning trees

Indexed keywords

APPROXIMATION ALGORITHMS; BUDGET CONTROL; CLUSTERING ALGORITHMS; POLYNOMIAL APPROXIMATION;

ADJACENCY RELATIONS; CONSTRAINED MINIMUM SPANNING TREE; LAGRANGEAN RELAXATION; MINIMUM SPANNING TREES; MINIMUM TOTAL WEIGHTS; NON NEGATIVES; POLYNOMIAL TIME APPROXIMATION SCHEMES; UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 84947924569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_121     Document Type: Conference Paper

References (11)

1. V. Aggarwal, Y. Aneja and K. Nair, "Minimal spanning tree subject to a side constraint," Comput. Operations Res. 9, 287-296 (1982).
2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, McGraw Hill (1990).
3. M. Guignard and M.B. Rosenwein, "An application of Lagrangean decomposition to the resource-constrained minimum weighted arborescence problem," Networks 20, 345-359 (1990).
4. J.-H. Lin and J.S. Vitter, "e-approximations with minimum packing constraint violation," Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, 771-782 (1992).
5. M.V. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt III, "Bicriteria network design problems," Proc. Of the 22nd ICALP, LNCS 944, 487-498 (1995).
6. N. Meggido, "Applying parallel computation algorithms in the design of serial algorithms," Journal of the A CM30, 852-865 (1983).
7. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York (1988).
8. F.P. Preparata, "New parallel-sorting schemes", IEEE Trans. Cornput. C-27, 669-673 (1978).
9. R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, and H.B. Hunt III, "Many birds with one stone: Multi-objective approximation algorithms," Proceedings of the 25th Annual A CM Symposium on the Theory of Computing, 438-447 (1993).
10. D.B. Shmoys and E. Tardos, "Scheduling unrelated parallel machines with costs," Proc., 4th Annual ACM-SIAM Symposium on Discrete Algorithms, 448-454 (1993).
11. D.D. Sleator and R.E. Tarjan, "A Data Structure fo Dynamic Trees," Journal of Computer and System Sciences 26, 362-391 (1983).