Minimax flow tree problems

Networks

Volumn 54, Issue 3, 2009, Pages 117-129

  Chen, Hui ^a   Campbell, Ann ^a   Thomas, Barrett ^a   Tamir, Arie ^b  

^a UNIVERSITY OF IOWA   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Complexity; Flow; Minimax; Shortestpath trees; Trees

Indexed keywords

COMPLEXITY; FLOW; MINIMAX; SHORTESTPATH TREES; TREES;

EID: 70349316531     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20313     Document Type: Article

References (39)

1. R.K. Ahuja and V.V.S. Murty, Exact and heuristic algorithms for the optimum communication spanning tree problem, Transport Sci 21 (1987), 163-170.
2. E. Althaus, S. Funke, S. Har-Peled, J. Konemann, E.A. Ramos, and M. Skutella, Approximating k-hop minimum spanning trees, Oper Res Lett 33 (2005), 115-120.
3. L. Cai and D.G. Corneil, Tree spanners, SIAM J Discrete Math 8 (1995), 359-387.
4. H. Chen, A.M. Campbell, and B.W. Thomas, Network design for time-constrained delivery, Naval Res Logist 55 (2008), 493-515.
5. L.P. Chew, There is a planar graph almost as good as the complete graph, Proceedings of the Second Annual Symposium on Computational Geometry, New York, NY, USA, 1986, pp. 169-177.
6. H.S. Connamacher and A. Proskurowski, The complexity of minimizing certain cost metrics for k-source spanning trees, Discrete Appl Math 131 (2003), 113-127.
7. G. Dahl, The 2-hop spanning tree problem, Oper Res Lett 23 (1998), 21-26.
8. P.M. Dearing and R.L. Francis, A minimax location problem on tree networks, Transport Sci 8 (1974), 333-343.
9. A.M. Farley, P. Fragopoulou, D. Krumme, A. Proskurowski, and D. Richards, Multi-source spanning tree problem, J Interconnection Networks 1 (2000), 61-71.
10. P. Fragopoulou, S.D. Nikolopoulos, and L. Palios, Multi- source trees: Algorithms for minimizing eccentricity cost metrics, ISAAC, Vol.3827: Lecture Notes in Computer Science, Springer, 2005, pp. 1080-1089.
11. R.L. Francis, L.F. McGinnis Jr., and J.A. White, Facility layout and location: An analytical approach, Prentice-Hall, Englewood Cliffs, New Jersey, 1992.
12. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J Assoc Comput Mach 34 (1987), 596-615.
13. M.R. Garey and D.S. Johnson, Computer and intractability: A guide to the theory of NP-completeness, W. H. Freeman and Company, New York, 1979.
14. L. Gouveia, Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints, Comput & Oper Res 22 (1995), 959-970.
15. L. Gouveia, Multicommodity flow models for spanning trees with hop constraints, Eur J Oper Res 95 (1996), 178-190.
16. L. Gouveia, Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints, Informs J Comput 10 (1998), 180-188.
17. L. Gouveia and C. Requejo, A new Lagrangian relaxation approach for the hop-constrained minimum spanning tree problem, Eur J Oper Res 132 (2001), 539-552.
18. S.L. Hakimi, Optimal locations of switching centers and medians of a graph, Oper Res 12 (1964), 450-459.
19. G.Y. Handler, Minimax location of a facility in an undirected tree graph, Transport Sci 7 (1973), 287-293.
20. G.Y. Handler and P.B. Mirchandani, Location on Networks, MIT Press, Cambridge, MA, 1979.
21. R. Hassin and A. Tamir, On the minimum diameter spanning tree problem, Inform Process Lett 53 (1995), 109-111.
22. J. Hershberger and S. Suri, Off-line maintenance of planar configurations, J Algorithms 21 (1996), 453-475.
23. J.-M. Ho, D.T. Lee, C.-H. Chang, and C.K. Wong, Minimum diameter spanning trees and related problems, SIAM J Comput 20 (1991), 987-997.
24. T.C. Hu, Optimum communication spanning trees, SIAM J Comput 3 (1974), 188-195.
25. D.S. Johnson, J.K. Lenstra, and A.H.G. Rinnooy Kan, The complexity of the network design problem, Networks 8 (1978), 279-285.
26. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems. I. The p-centers, SIAM J Appl Math 37 (1979), 513-538.
27. D.W. Krumme and P. Fragopoulou, Minimum eccentricity multicast trees, Discrete Math Theor Comput Sci 4 (2001), 157-172.
28. P. Manyem and M.F.M. Stallmann, Some approximation results in multicasting, Working Paper, 1996.
29. H.B. McMahan and A. Proskurowski, Multi-source spanning trees: Algorithm for minimizing source eccentricities, Discrete Appl Math 137 (2004), 213-222.
30. D. Peleg, Polylogarithmic approximation for minimum communication spanning trees, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, 1997, CS97-10.
31. D. Peleg and E. Reshef, Deterministic polylog approximation for minimum communication spanning trees (extended abstract), Lecture Notes Comput Sci 1443 (1998), 670-681.
32. D. Peleg and J.D. Ullman, An optimal synchronizer for the hypercube, Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, 1987, pp. 77-85.
33. W.B. Powell and I.A. Koskosidis, Shipment routing algorithms with tree constraints, Transport Sci 26 (1992), 230-245.
34. S. Voss, The steiner tree problem with hop constraints, Ann Oper Res 86 (1999), 321-345.
35. B.Y. Wu, A polynomial-time approximation scheme for the two-source minimum routing cost spanning trees, J Algorithms 44 (2002), 359-378.
36. B.Y. Wu, An improved algorithm for the k-source maximum eccentricity spanning trees, Discrete Appl Math 143 (2004), 342-350.
37. B.Y. Wu, G. Lancia, V. Bafna, K.-M. Chao, R. Ravi, and C.Y. Tang, A polynomial-time approximation scheme for minimum routing cost spanning trees, SIAM J Comput 29 (1999), 761-778.
38. B.Y. Wu, K.-M. Chao, and C.Y. Tang, Approximation algorithm for some optimum communication spanning tree problems, Discrete Appl Math 102 (2000), 245-266.
39. B.Y. Wu, K.-M. Chao, and C.Y. Tang, Approximation algorithm for the shortest total path length spanning tree problem, Discrete Appl Math 105 (2000), 273-289.