Computing minimum dilation spanning trees in geometric graphs
DOI10.1007/978-3-319-21398-9_24zbMATH Open1465.68266OpenAlexW2276605036MaRDI QIDQ3196394FDOQ3196394
Authors: Aléx F. Brandt, Miguel F. A.de M. Gaiowski, Pedro J. de Rezende, Cid Carvalho de Souza 
Publication date: 29 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21398-9_24
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Geometric Spanner Networks
- Title not available (Why is that?)
- Graph spanners
- GRASP and path relinking for the max-min diversity problem
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard
- Computing a minimum-dilation spanning tree is NP-hard
- Algorithms – ESA 2004
- Experimental study of geometric \(t\)-spanners
- Sparse geometric graphs with small dilation
Cited In (11)
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
- General variable neighborhood search for the minimum stretch spanning tree problem
- Optimal spanners for axis-aligned rectangles
- Title not available (Why is that?)
- Minimum dilation stars
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard
- Algorithms and Computation
- An exact algorithm for the minimum dilation triangulation problem
- Computing geometric minimum-dilation graphs is NP-hard
- Algorithms and Computation
- Computing a minimum-dilation spanning tree is NP-hard
This page was built for publication: Computing minimum dilation spanning trees in geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196394)
