scientific article; zbMATH DE number 7768369

DOI10.4230/LIPICS.APPROX/RANDOM.2021.24arXiv2011.03194MaRDI QIDQ6090899FDOQ6090899

Chandra Chekuri, Manuel Torres, Kent Quanrud

Publication date: 20 November 2023

Full work available at URL: https://arxiv.org/abs/2011.03194

Title of this publication is not available (Why is that?)

zbMATH Keywords

fast approximation algorithmsbounded degree spanning treecrossing spanning treeswap rounding

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (4)

• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• On approximating tree spanners that are breadth first search trees
• Fixed-Parameter Tractability for Non-Crossing Spanning Trees
• Near-optimal bounded-degree spanning trees

This page was built for publication:

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