The following pages link to (Q4231910):
Displayed 21 items.
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← 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)
- The shortest multipaths problem in a capacitated dense channel (Q859708) (← links)
- Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs (Q924540) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- Scheduling multicasts on unit-capacity trees and meshes. (Q1401961) (← links)
- Adaptive packet routing for bursty adversarial traffic (Q1577008) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Call control with \(k\) rejections (Q1877703) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- Inapproximability and approximability of maximal tree routing and coloring (Q2498986) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)