The Maximum Edge-Disjoint Paths Problem in Bidirected Trees-Reference-Cited by-同舟云学术

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

Published:2001-01 Issue:3 Volume:14 Page:326-355
ISSN:0895-4801
Container-title:SIAM Journal on Discrete Mathematics
language:en
Short-container-title:SIAM J. Discrete Math.

Author:

Erlebach Thomas,Jansen Klaus

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics

Link

http://epubs.siam.org/doi/pdf/10.1137/S0895480199361259

Reference11 articles.

1. BaruchAwerbuch, YossiAzar, AmosFiat, StefanoLeonardi, AdiRosén, On‐line competitive algorithms for call admission in optical networks, Lecture Notes in Comput. Sci., Vol. 1136, Springer, Berlin, 1996, 431–44410.1007/s00453-001-0039-198d:68023

2. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

3. The complexity of path coloring and call scheduling

4. Optimal wavelength routing on directed fiber trees

5. Primal-dual approximation algorithms for integral flow and multicut in trees

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands;IEEE/ACM Transactions on Networking;2023

2. Robust Online Algorithms for Dynamic Choosing Problems;Lecture Notes in Computer Science;2021

3. Solving the edge-disjoint paths problem using a two-stage method;International Transactions in Operational Research;2018-04-30

4. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing;PLOS ONE;2015-12-28

5. Parameterized maximum path coloring;Theoretical Computer Science;2013-11