Minimum spanning tree of line segments

DOI10.1007/978-3-319-94776-1_44OpenAlexW2809830069MaRDI QIDQ1791012

Subhas C. Nandy, Ramesh K. Jallu, Sanjana Dey

Publication date: 4 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_44

zbMATH Keywords

approximation algorithmNP-completenessminimum spanning tree\(k\)-MST

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: Minimum spanning tree of line segments