Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees

ACM Journal of Experimental Algorithmics

Volumn 7, Issue , 2002, Pages

  Erlebach, Thomas ^a   Jansen, Klaus ^b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Algorithms; Combinatorial optimization; Experimentation; F.2.2 analysis of algorithms and problem complexity : nonnumerical algorithms and problems computations on discrete structures; Linear programming

Indexed keywords

EID: 15344344670     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/944618.944624     Document Type: Article

References (17)

1. nd Annual ACM Symposium on Theory of Computing STOC'00 (2000), pp. 735-744.
2. BAR-NOY, A., GUHA, S., NAOR, J. S., AND SCHIEBER, B. 2001. Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing 31, 2, 331-352.
3. BERMAN, P. AND DASGUPTA, B. 2000. Multi-phase algorithms for throughput maximization for real-time scheduling. Journal of Combinatorial Optimization 4, 3, 307-323.
4. CPLEX. 1999. CPLEX 6.5. ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. http://www.cplex.com/.
5. ERLEBACH, T. 1999. Scheduling Connections in Fast Networks. Ph. D. thesis, Technische Universität München. http://www.tik.ee.ethz.ch/~erlebach/dissertation.ps.gz.
6. ERLEBACH, T. AND JANSEN, K. 1999. Efficient implementation of an optimal greedy algorithm for wavelength assignment in directed tree networks. ACM Journal of Experimental Algorithmics 4.
7. ERLEBACH, T. AND JANSEN, K. 2000. Conversion of coloring algorithms into maximum weight independent set algorithms. In ICALP Workshops 2000, Proceedings in Informatics 8 (2000), pp. 135-145. Carleton Scientific.
8. ERLEBACH, T. AND JANSEN, K. 2001. The maximum edge-disjoint paths problem in bidirected trees. SIAM Journal on Discrete Mathematics 14, 3, 326-355.
9. ERLEBACH, T., JANSEN, K., KAKLAMANIS, C., MIHAIL, M., AND PERSIANO, P. 1999. Optimal wavelength routing on directed fiber trees. Theoretical Computer Science 221, 119-137. Special issue of ICALP'97.
10. ERLEBACH, T., JANSEN, K., KAKLAMANIS, C., AND PERSIANO, P. 1998. An optimal greedy algorithm for wavelength allocation in directed tree networks. In Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location, Volume 40 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1998), pp. 117-129. AMS.
11. GARG, N., VAZIRANI, V. V., AND YANNAKAKIS, M. 1997. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 1, 3-20.
12. st Annual ACM Symposium on Theory of Computing STOC'99 (1999), pp. 19-28.
13. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2, 4, 225-231.
14. KLEINBERG, J. 1996. Approximation algorithms for disjoint paths problems. Ph. D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology.
15. th Annual Symposium on Foundations of Computer Science FOCS'95 (1995), pp. 52-61.
16. MEHLHORN, K. AND NÄHER, S. 1999. LEDA - A Platform for Combinatorial and Geometrical Computing. Cambridge University Press.
17. SCHIEBER, B. AND VISHKIN, U. 1988. On finding lowest common ancestors: Simplification and parallelization. SIAM Journal on Computing 17, 6, 1253-1262.