✦ LIBER ✦

Approximability of unsplittable shortest path routing problems

✍ Scribed by Andreas Bley

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 621 KB
Volume: 54
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal routing in shortest-path data ne

Optimal routing in shortest-path data networks

✍ K. G. Ramakrishnan; Manoel A. Rodrigues 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 249 KB 👁 1 views

Approximation algorithms for some k-sour

Approximation algorithms for some k-source shortest paths spanning tree problems

✍ Yen Hung Chen; Bang Ye Wu; Chuan Yi Tang 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

Complexity of some inverse shortest path

Complexity of some inverse shortest path lengths problems

✍ Tingting Cui; Dorit S. Hochbaum 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 262 KB

Characterization results of all shortest

Characterization results of all shortest paths interval routing schemes

✍ M. Flammini; G. Gambosi; U. Nanni; R.B. Tan 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

Valid cycles: A source of infeasibility

Valid cycles: A source of infeasibility in open shortest path first routing

✍ Peter Broström; Kaj Holmberg 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

Approximation results for min-max path c

Approximation results for min-max path cover problems in vehicle routing

✍ Zhou Xu; Liang Xu; Chung-Lun Li 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 410 KB

## Abstract This article studies a min‐max path cover problem, which is to determine a set of paths for __k__ capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when