Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem

DOI10.1007/978-3-319-08016-1_9zbMATH Open1409.68332OpenAlexW128000029MaRDI QIDQ3188838

Longkun Guo

Publication date: 2 September 2014

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08016-1_9

zbMATH Keywords

bifactor approximation algorithmflow theoryLP rounding\(k\)-disjoint restricted shortest path problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem