S. G. Kolliopoulos, Exact and Approximation Algorithms for Network Flow and DisjointPath Problems, PhD thesis, Dartmouth College, 1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Near-Optimal Hardness Results and Approximation.. - Guruswami.. (1999) (44 citations) (Correct)
....has length at most L, we can construct in polynomial time a path in D from s to t that has length at most L and has at most k arcs. To complete the description of the algorithm, we note that we can determine the existence of path P 0 by finding the shortest path between s1 and t k . In [15] [17], and [19] the greedy algorithm is analyzed to show that it satisfies at least Ou= p m demands for an instance of EDP (also see [4] Recall that Ou denotes the optimum value for a given USF instance. Their arguments may be extended easily to give p u(A) approximations for unsplittable ....
....contain an arc of length 1 from D O that is in common with some P i . We choose i to be minimal. Thus for each demand in Q we associate a unique such P i which blocks that demand. Conversely, let k i be the number of demands in Q which are blocked by P i . We now build on the ideas used in [17, 19]. Since we may assume that both the optimal and greedy solutions are contiguous, we deduce that P i may block at most n i Delta flow systems, where n i is the number of arcs of length 1 with positive flow under P i . Thus k i n i Delta. But also by greedy we have that each such blocked flow ....
S. G. Kolliopoulos. Exact and approximation algorithms for network flow and disjoint-path problems. PhD Thesis, Dartmouth College, Hanover, NH, August 1998.
Approximating Disjoint-Path Problems Using Packing Integer.. - Kolliopoulos, Stein (1998) (1 citation) Self-citation (Kolliopoulos) (Correct)
No context found.
S. G. Kolliopoulos. Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems. PhD thesis, Dartmouth College, Hanover, NH, August 1998.
Experimental Evaluation of Approximation Algorithms for.. - Kolliopoulos, Stein (1999) Self-citation (Kolliopoulos) (Correct)
No context found.
S. G. Kolliopoulos. Exact and Approximation Algorithms for Network Flow and Disjoint-Path Problems. PhD thesis, Dartmouth College, Hanover, NH, August 1998.
Approximation Algorithms for Single-Source Unsplittable Flow - Kolliopoulos, Stein (1997) (2 citations) Self-citation (Kolliopoulos) (Correct)
No context found.
S. G. Kolliopoulos, Exact and Approximation Algorithms for Network Flow and DisjointPath Problems, PhD thesis, Dartmouth College, Hanover, NH, August 1998.
On the k-Splittable Flow Problem - Baier, Köhler, Skutella (2002) (2 citations) (Correct)
No context found.
S. G. Kolliopoulos, Exact and Approximation Algorithms for Network Flow and DisjointPath Problems, PhD thesis, Dartmouth College, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC