S. Fortune, J. Hopcroft, J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111--121, 1980. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Selfish Routing - Roughgarden (2002) (3 citations) (Correct)
....Proof. We will make use of the problem 2 Directed Disjoint Paths (2DDP) given a directed graph G = V, E) and distinct vertices s 1 , s 2 , t 1 , t 2 V , are there s i t i paths P i for i = 1, 2, such that P 1 and P 2 are vertex disjoint This problem was proved NP complete by Fortune et al. [70]. We will show that a ( #) approximation algorithm for Linear Latency Network Design can be used to distinguish yes and no instances of 2DDP in polynomial time. of 2DDP, as above. Augment the vertex set V by an additional source s and sink t, and include directed edges (s, s 1 ) s, s ....
S. Fortune, J. E. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111--121, 1980.
A Course in Combinatorial Optimization - Schrijver (2003) (9 citations) (Correct)
....x is a feasible solution of (43) if x satisfies Ax b. If x moreover attains the maximum, x is called an optimum solution. The famous method to solve linear programming problems is the simplex method, designed by Dantzig [1951b] The first polynomial time method for LP problems is due to Khachiyan [1979, 1980], based on the ellipsoid method. In 1984, Karmarkar [1984] published another polynomial time method for linear programming, the interior point method, which turns out to be competitive in practice with the simplex method. The Duality theorem of linear programming, due to von Neumann [1947] states ....
....has depth at most n, each application of algorithm (14) takes O(nm) time. Since the number of applications is at most n, we have the time bound given in the theorem. In fact, the method can be sharpened to O(n ) Balinski [1969] O(n ) Even and Kariv [1975] and even to O(n m) Micali and Vazirani [1980]) For surveys, see Lawler [1976] Ch. 6 and Christofides [1975] Ch. 12. Application 5.1: Pairing. If a certain group of people has to be split into pairs, where certain pairs fit and other pairs do not fit (for instance, when assigning hotel rooms or bus seats to a touring group) we have an ....
[Article contains additional citation context not shown here]
S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10 (1980) 111--121.
The Complexity of Constraints on Intervals and Lengths - Krokhin, Jeavons, Jonsson (2002) (Correct)
....complexity. Dichotomy results rule out such a possibility within certain classes of problems. Dichotomy theorems have previously been established for the Generalized Satisfiability [5] and Graph H coloring [6] problems mentioned above as well as the Directed Subgraph Homeomorphism problem [25]. Constraint satisfaction problems have been a fruitful source of dichotomy results (see, e.g. 26, 27] For constraint satisfaction problems, the relevant parameter is usually the set of relations, F , specifying the allowed constraints. This parameter usually runs over an in nite set of ....
Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10 (1980) 111-121
Edge Disjoint Paths Revisited - Chekuri, Khanna (2003) (11 citations) (Correct)
....respectively, in some optimum solution. EDP in directed graphs appears to be fundamentally harder than in undirected graphs. For example, given a directed graph G, the problem of deciding if two given pairs, s 1 ; t 1 ) and (s 2 ; t 2 ) can be connected via disjoint paths is already NP hard [5]. In undirected graphs, for any fixed k, Robertson and Seymour [17] gave a polynomial time algorithm to decide if a given set of k pairs can be connected via disjoint paths. However, their algorithm is highly non trivial and requires extensive machinery from the work on graph minors. Surprisingly, ....
....time algorithm to decide if a given set of k pairs can be connected via disjoint paths. However, their algorithm is highly non trivial and requires extensive machinery from the work on graph minors. Surprisingly, there is a fairly simple algorithm for the same problem in directed acyclic graphs [5]. Until recently, it was only known that EDP is APX hard [9] Guruswami et al. 10] via a simple reduction to the two pair decision problem mentioned above, showed that it is NP hard to approximate EDP in directed graphs to within a Omega Gamma m ) factor for every fixed 0. Independently, ....
S. FORTUNE, J. HOPCROFT AND J. WYLLIE. The directed subgraph homeomorphism problem. Theoretical Computer Science, Vol. 10, No. 2 (1980), pp. 111--121.
Cost-Based Filtering for Shorter Path Constraints - Meinolf Sellmann Cornell (2003) (2 citations) (Correct)
No context found.
S. Fortune, J. Hopcroft, J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111--121, 1980.
Cost-Based Filtering for Shorter Path Constraints - Meinolf Sellmann Cornell (2003) (2 citations) (Correct)
No context found.
S. Fortune, J. Hopcroft, J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111--121, 1980.
Parameterized Tractability of Edge-Disjoint Paths - On Directed Acyclic (Correct)
No context found.
S. Fortune, J. Hopcroft and J. Wyllie, "The directed subgraph homeomorphism problem," Theoretical Computer Science, 10 (1980) 111-121.
Reserving Resilient Capacity for a Single Commodity.. - Brightwell, Oriolo.. (Correct)
No context found.
S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10 (1980) 111-121.
Reserving Resilient Capacity in a Network - Brightwell, Oriolo, Shepherd (2001) (1 citation) (Correct)
No context found.
S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10 (1980) 111--121.
Some Strategies for Reserving Resilient Capacity - Brightwell, Oriolo, Shepherd (1998) (3 citations) (Correct)
No context found.
S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10 (1980) 111-121. 42
Near-Optimal Hardness Results and Approximation.. - Guruswami.. (1999) (44 citations) (Correct)
No context found.
S. Fortune, J. Hopcroft and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, Vol. 10, No. 2 (1980), pp. 111-121.
Efficient Algorithms for Computing Disjoint QoS Paths - Orda, Sprintson (2004) (Correct)
No context found.
S. Fortune, J. Hopcroft, and J. Wyllie, "The Directed Subgraph Homeomorphism Problem," Theoretical Computer Science, vol. 10, no. 2, pp. 111--121, 1980.
New Results on the Computability and Complexity of Points - to .. - Chakaravarthy (2003) (1 citation) (Correct)
No context found.
S. Fortune, J. Hopcroft, and J. Wyllie. The directed subg raph homeomorphism problem. Theoretical Computer Science, 10:111--121, 1980.
Expressiveness and Complexity of Graph Logic - Anuj Dawar Philippa (2004) (Correct)
No context found.
S. Fortune, J. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111--121, 1980.
Designing Networks for Selfish Users is Hard - Roughgarden (2002) (17 citations) (Correct)
No context found.
S. Fortune, J. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111--121, 1980.
Chordless Paths Through Three Vertices - Haas, Hoffmann (Correct)
No context found.
FORTUNE, S., HOPCROFT, J. E., AND WYLLIE, J. The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10 (1980), 111--121.
Cuts and Disjoint Paths in the Valley-Free Path Model - Erlebach, Hall.. (2003) (Correct)
No context found.
S. Fortune, J. Hopcroft, and J. Willie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10(2):111--121, 1980.
Network Coding in Undirected Networks - Li, Li (2004) (Correct)
No context found.
S. Fortune, J. Hopcroft, and J. Wyllie, "The Directed Subgraph Homeomorphism Problem," Theoretical Computer Science, vol. 10, no. 2, pp. 111--121, 1980.
Parameterized Tractability of Edge-Disjoint Paths on Directed.. - Slivkins (2003) (1 citation) (Correct)
No context found.
S. Fortune, J. Hopcroft and J. Wyllie, "The directed subgraph homeomorphism problem," Theoretical Computer Science, 10 (1980) 111-121.
Arc-Disjoint Paths in Expander Digraphs - Bohman, Frieze (2001) (1 citation) (Correct)
No context found.
S. Fortune, J.E. Hopcroft and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10 (1980) 111-121.
A Note on Orientations of Mixed Graphs - Esther Arkin Refael (Correct)
No context found.
S. Fortune, J. Hopcroft and J. Wyllie, \The directed subgraph homeomorphism problem", Theoretical Computer Science 10 (1980) 111-121.
Reserving Resilient Capacity for a Single Commodity.. - Brightwell, Oriolo.. (Correct)
No context found.
S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10 (1980) 111-121.
Some Strategies for Reserving Resilient Capacity - Brightwell Oriolo Centre (1998) (3 citations) (Correct)
No context found.
S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10 (1980) 111-121. 42
Meet and Merge: Approximation Algorithms for Confluent Flows - Chen, Rajaraman, Sundaram (2003) (Correct)
No context found.
S. Fortune, J. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111--121, 1980.
Designing Networks for Selfish Users is Hard - Roughgarden (2002) (17 citations) (Correct)
No context found.
S. Fortune, J. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111--121, 1980.
First 50 documents Next 50
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