Pages that link to "Item:Q5890864"

The following pages link to Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5890864):

Displaying 24 items.

• Length 3 edge-disjoint paths is NP-hard (Q445249) (← links)
• Short length Menger's theorem and reliable optical routing (Q557907) (← links)
• Minimal multicut and maximal integer multiflow: a survey (Q707131) (← links)
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem (Q845550) (← links)
• A note on the greedy algorithm for the unsplittable flow problem (Q1028992) (← links)
• Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
• Call control with \(k\) rejections (Q1877703) (← links)
• On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964) (← links)
• On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
• Paths and trails in edge-colored graphs (Q2378531) (← links)
• Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
• A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 (Q3177821) (← links)
• On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
• Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems (Q3569819) (← links)
• Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719) (← links)
• An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two (Q4962640) (← links)
• (Q5136255) (← links)
• Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow (Q5450805) (← links)
• Paths and Trails in Edge-Colored Graphs (Q5458574) (← links)
• Flows on few paths: Algorithms and lower bounds (Q5487813) (← links)
• Flows with Unit Path Capacities and Related Packing and Covering Problems (Q5505656) (← links)
• Connectivity and inference problems for temporal networks (Q5894823) (← links)
• Solving the edge‐disjoint paths problem using a two‐stage method (Q6066718) (← links)
• Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)