Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems

DOI10.1007/978-3-642-13036-6_16zbMath1284.05269OpenAlexW4301522924MaRDI QIDQ3569819

José Neto, Andreas Bley

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_16

zbMATH Keywords

complexitygraph algorithmsapproximation algorithmslength-bounded paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

On the number of edges in a graph with many two-hop disjoint paths ⋮ On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow ⋮ Trade-offs among degree, diameter, and number of paths

This page was built for publication: Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems