scientific article; zbMATH DE number 2079393
From MaRDI portal
Publication:4471352
zbMATH Open1092.68620MaRDI QIDQ4471352FDOQ4471352
Authors: Chandra Chekuri, Sanjeev Khanna 
Publication date: 28 July 2004
Title of this publication is not available (Why is that?)
Recommendations
- Edge-disjoint paths revisited
- scientific article; zbMATH DE number 5899246
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Edge Disjoint Paths in Moderately Connected Graphs
Cited In (35)
- Routing in undirected graphs with constant congestion
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- Approximability of Packing Disjoint Cycles
- Edge Disjoint Paths in Moderately Connected Graphs
- Single-Sink Multicommodity Flow with Side Constraints
- Approximation algorithms for orienting mixed graphs
- Disjoint paths in sparse graphs
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm
- A note on the greedy algorithm for the unsplittable flow problem
- Solving the edge‐disjoint paths problem using a two‐stage method
- Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees
- Reconstructing edge-disjoint paths.
- Graph-Theoretic Concepts in Computer Science
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge Disjoint Paths in Moderately Connected Graphs
- On the Max-flow min-cut ratio for directed multicommodity flows
- Flows on few paths: Algorithms and lower bounds
- Edge-disjoint paths revisited
- On structural parameterizations of the edge disjoint paths problem
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- On the disjoint paths problem
- Title not available (Why is that?)
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs
- The maximum edge-disjoint paths problem in bidirected trees
- Title not available (Why is that?)
- Edge-disjoint homotopic paths in a planar graph with one hole
- Non-shared edges and nearest neighbor interchanges revisited
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- Flows with unit path capacities and related packing and covering problems
- Shortest edge-disjoint paths in graphs
- The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint
- Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471352)
