Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems - ANR - Agence nationale de la recherche Accéder directement au contenu
Article Dans Une Revue Dagstuhl Reports Année : 2017

Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems

Résumé

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.
Fichier principal
Vignette du fichier
LIPIcs-ICALP-2017-125.pdf (529.11 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02089412 , version 1 (03-04-2019)

Identifiants

Citer

Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco. Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. Dagstuhl Reports, 2017, 80 (125), pp.1-13. ⟨10.4230/LIPIcs.ICALP.2017.125⟩. ⟨hal-02089412⟩
87 Consultations
33 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More