✦ LIBER ✦

On the Hardness of Equal Shortest Path Routing

✍ Scribed by Giroire, Frédéric; Pérennes, Stéphane; Tahiri, Issam

Book ID: 122415008
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 215 KB
Volume: 41
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.05.123

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Monotonicity testing and shortest-path r

Monotonicity testing and shortest-path routing on the cube

✍ Jop Briët, Sourav Chakraborty, David García-Soriano, Arie Matsliah 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 268 KB

A transformation of hard (equality const

A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems

✍ Michel Minoux; Celso Ribeiro 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Approximability of unsplittable shortest

Approximability of unsplittable shortest path routing problems

✍ Andreas Bley 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 621 KB

Shortest path routing and fault-tolerant

Shortest path routing and fault-tolerant routing on de Bruijn networks

✍ Mao, Jyh-Wen; Yang, Chang-Biau 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB 👁 1 views

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the bina

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

Shortest path routing algorithm using Ho

Shortest path routing algorithm using Hopfield neural network

✍ Ahn, C.W.; Ramakrishna, R.S.; Kang, C.G.; Choi, I.C. 📂 Article 📅 2001 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 377 KB