Online \(k\)-color spanning disk problems

DOI10.1007/s10878-023-01080-zMaRDI QIDQ6053966

Yin Wang, Yin-Feng Xu, Weitian Tong, Hui-Li Zhang

Publication date: 27 September 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

competitive ratioVoronoi diagramonline algorithmminimum color spanning disk

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Approximation algorithms for color spanning diameter
• Computing minimum diameter color-spanning sets is hard
• Minimum diameter color-spanning sets revisited
• Farthest color Voronoi diagrams: complexity and algorithms
• On some matching problems under the color-spanning model
• Expected computations on color spanning sets
• On some geometric problems of color-spanning sets
• Computing the Smallest Color-Spanning Axis-Parallel Square
• Computing Minimum Diameter Color-Spanning Sets
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Optimal Search in Planar Subdivisions

This page was built for publication: Online \(k\)-color spanning disk problems