𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Line planning, path constrained network flow and inapproximability

✍ Scribed by Christina Büsing; Sebastian Stiller

Book ID
102548602
Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
148 KB
Volume
57
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line disjoint path routing for networ
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
✍ Weifa Liang; Yuzhen Liu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 290 KB

In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messages routed successfully by the network without any knowledge of future disjoint path connection request arrivals and gene

On-line algorithm for optimal 3D path pl
On-line algorithm for optimal 3D path planning
✍ Chien-Wan Hun; Hun-Chen Chen; Ming-Fung Hwang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 927 KB

The issues of automatic car operation aiming at in an unknown complex terrain are the most effective path planning and the obstacles avoiding in this complex terrain. For that, an on-line algorithm for guiding a mobile object in an unexplored terrain filled with convex polygonal obstacles is present