Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems

Abstract : We revisit fundamental problems in undirected and directed graphs, such as the problems of computing spanning trees, shortest paths, steiner trees, and spanning arborescences of minimum cost. We assume that there are d different cost functions associated with the edges of the input graph and seek for solutions to the resulting multidimensional graph problems so that the p - norm of the different costs of the solution is minimized. We present combinatorial algorithms that achieve very good approximations for this objective. The main advantage of our algorithms is their simplicity: they are as simple as classical combinatorial graph algorithms of Dijkstra and Kruskal, or the greedy algorithm for matroids.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02089412
Contributor : Anne L'Azou <>
Submitted on : Wednesday, April 3, 2019 - 5:19:27 PM
Last modification on : Tuesday, April 16, 2019 - 1:43:09 AM

File

LIPIcs-ICALP-2017-125.pdf
Publisher files allowed on an open archive

Identifiers

Citation

Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco. Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. Dagstuhl Reports, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017, ⟨10.4230/LIPIcs.ICALP.2017.125⟩. ⟨hal-02089412⟩

Share

Metrics

Record views

28

Files downloads

17