Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.125
URN: urn:nbn:de:0030-drops-74669
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7466/
Bilò, Vittorio ; Caragiannis, Ioannis ; Fanelli, Angelo ; Flammini, Michele ; Monaco, Gianpiero
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{bil_et_al:LIPIcs:2017:7466,
author = {Vittorio Bil{\`o} and Ioannis Caragiannis and Angelo Fanelli and Michele Flammini and Gianpiero Monaco},
title = {{Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {125:1--125:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7466},
URN = {urn:nbn:de:0030-drops-74669},
doi = {10.4230/LIPIcs.ICALP.2017.125},
annote = {Keywords: multidimensional graph problems, matroids, shortest paths, Steiner trees, arborescences}
}
| Keywords: | multidimensional graph problems, matroids, shortest paths, Steiner trees, arborescences | |
| Seminar: | 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 07.07.2017 |
