Location of Repository

This is the authors' final draft of the Book Chapter published as Lecture Notes in Computer Science, 2006, vol. 3484, pp.97-134. The final published version is available at http://www.springerlink.com/content/776r8537473327kg/?p=bd70936677d64284ba69425ca9725b6f&pi=17

Publisher: Springer Verlag

Year: 2006

OAI identifier:
oai:lra.le.ac.uk:2381/3518

Provided by:
Leicester Research Archive

Downloaded from
https://lra.le.ac.uk/bitstream/2381/3518/1/edpsurvey.pdf

- (2002). A note on the greedy algorithm for the unsplittable flow problem.
- (1998). A partial k-arboretum of graphs with bounded treewidth.
- A tourist guide through treewidth.
- (2001). Admission control to minimize rejections.
- (1996). Approximability of the path coloring problem.
- (1998). Approximating disjoint-path problems using greedy algorithms and packing integer programs.
- (2002). Approximating the single source unsplittable min-cost flow problem.
- Approximation algorithms and complexity results for path problems in trees of rings.
- (2000). Approximation algorithms for disjoint paths and related routing and packing problems.
- (1996). Approximation algorithms for disjoint paths problems.
- (2002). Approximation algorithms for the unsplittable flow problem.
- (1995). Approximations for the disjoint paths problem in highdiameter planar networks.
- (2001). Arc-disjoint paths in expander digraphs.
- (1996). Clique is hard to approximate within n1−.
- Computers and Intractability. A Guide to the Theory of NP-Completeness.
- (1995). Disjoint paths in densely embedded graphs.
- (1994). Disjoint paths.
- (2003). Edge disjoint paths revisited.
- (2001). Edge-disjoint paths in expander graphs.
- (1982). Efficient algorithms for interval graphs and circular-arc graphs.
- Existence and construction of edgedisjoint paths on expander graphs.
- (2000). Finding edge-disjoint paths in partial ktrees.
- (2004). Graph decomposition and a greedy algorithm for edge-disjoint paths.
- (1995). Graph Minors XIII: The disjoint paths problem.
- (2003). Greedy edge-disjoint paths in complete graphs.
- (1997). Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems.
- (1995). Improved bounds for all optical routing.
- (2002). Improved bounds for the unsplittable flow problem.
- (1977). Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms.
- (1998). Maximal throughput in wavelength-routed optical networks.
- (2003). Minimizing request blocking in alloptical rings.
- (2003). Multicommodity demand flow in a tree.
- (1999). Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.
- (1999). Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems.
- (2001). New results for path problems in generalized stars, complete graphs, and brick wall graphs.
- (1993). On the complexity of the disjoint paths problem.
- (2000). On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints.
- (1999). On the single source unsplittable flow problem.
- (1994). On-line admission control and circuit routing for high performance computing and communication.
- (2001). On-line competitive algorithms for call admission in optical networks.
- (1998). On-line network routing.
- (1998). Online Computation and Competitive Analysis.
- (2000). Optimal construction of edge-disjoint paths in random regular graphs.
- (1999). Optimal construction of edgedisjoint paths in random graphs.
- (1990). Packing paths, circuits, and cuts – a survey.
- (1997). Primal-dual approximation algorithms for integral flow and multicut in trees.
- (1995). Randomized Algorithms.
- (1987). Randomized rounding: A technique for provably good algorithms and algorithmic proofs.
- Routing a permutation in the hypercube by two sets of edge disjoint paths.
- (1999). Scheduling Connections in Fast Networks.
- (2001). See also TIK-Report 109,
- (2000). Short disjoint paths on hypercubic graphs.
- (1996). Short paths in expander graphs.
- (2001). Simple on-line algorithms for the maximum disjoint paths problem.
- (2001). Strongly polynomial algorithms for the unsplittable flow problem.
- (1984). The complexity of wire routing and finding the minimum area layouts for arbitrary VLSI circuits.
- (1980). The directed subgraph homeomorphism problem.
- (2001). The maximum edge-disjoint paths problem in bidirected trees.
- (1986). Theory of linear and integer programming.
- Universal Routing Strategies for Interconnection Networks.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.