Simple greedy algorithms for fundamental multidimensional graph problems

DOI10.4230/LIPICS.ICALP.2017.125zbMATH Open1442.68162OpenAlexW2740004110MaRDI QIDQ5111457FDOQ5111457

Authors: Vittorio Bilò, I. Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco 

Publication date: 27 May 2020

Full work available at URL: https://hal.science/hal-02089412

Recommendations

• Multi-rooted greedy approximation of directed Steiner trees with applications
• Approximating minimum-cost graph problems with spanning tree edges
• On spanning tree problems with multiple objectives
• scientific article; zbMATH DE number 3891405
• CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS

zbMATH Keywords

shortest pathsmatroidsSteiner treesarborescencesmultidimensional graph problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cited In (6)

• Spanning Trees With Edge Conflicts and Wireless Connectivity
• Approximation algorithms for multi-parameter graph optimization problems
• Title not available (Why is that?)
• Approximating combinatorial optimization problems with the ordered weighted averaging criterion
• Approximating the shortest path problem with scenarios
• Network design under general wireless interference

This page was built for publication: Simple greedy algorithms for fundamental multidimensional graph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111457)