scientific article; zbMATH DE number 1263178

MaRDI QIDQ4234048zbMATH OpenFDO

Authors Éva Tardos, Jon M. Kleinberg

Publication date 3 February 2002

zbMATH Keywords

admission controlhigh-speed networksNP-complete problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Approximations for the disjoint paths problem in high-diameter planar networks
• An O( n)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs
• An O( n)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs
• An Approximation Algorithm for Fully Planar Edge-Disjoint Paths

Cited in

(14)

• Approximations for the disjoint paths problem in high-diameter planar networks
• On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
• Maximum edge-disjoint paths in planar graphs with congestion 2
• Connectivity and constructive algorithms of disjoint paths in dragonfly networks
• An O( n)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs
• Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
• An O( n)-approximation algorithm for the disjoint paths problem in Eulerian planar graphs and 4-edge-connected planar graphs
• Optimal Construction of Edge-Disjoint Paths in Random Graphs
• The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
• Improved approximation for node-disjoint paths in planar graphs
• Short length Menger's theorem and reliable optical routing
• Solving the edge‐disjoint paths problem using a two‐stage method
• Minimal multicut and maximal integer multiflow: a survey
• Approximating call-scheduling makespan in all-optical networks

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 Q4234048)