scientific article; zbMATH DE number 871938
From MaRDI portal
Publication:4875213
zbMath0857.90129MaRDI QIDQ4875213
Publication date: 18 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
minimum spanning treegeometric network designguillotine subdivisionrectilinear polygonal subdivision
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Applications of design theory to circuits and networks (94C30)
Related Items
Approximation schemes for node-weighted geometric Steiner tree problems, Improved bounds for vehicle routing solutions, Faster geometric \(k\)-point MST approximation, An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane, Shape rectangularization problems in intensity-modulated radiation therapy, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems, Local search algorithms for the \(k\)-cardinality tree problem., Approximation algorithms for lawn mowing and milling, A constant-factor approximation algorithm for the \(k\)-MST problem
