𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem

✍ Scribed by Luciano Gualà; Guido Proietti

Publisher
Springer
Year
2007
Tongue
English
Weight
504 KB
Volume
49
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dual algorithms for the shortest path tr
Dual algorithms for the shortest path tree problem
✍ Pallottino, Stefano; Scutell�, Maria Grazia 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and

Inapproximability results for the invers
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
✍ Andreas Bley 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph __D__ = (__V__, __A__), the task is to find positive integer arc lengths such that th

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami