Tight Approximation Bounds for Connectivity with a Color-Spanning Set

DOI10.1007/978-3-642-45030-3_55zbMath1406.68075OpenAlexW838615464MaRDI QIDQ2872123

Binhai Zhu, Chenglin Fan, Jun Luo

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_55

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (4)

Fréchet Distance for Uncertain Curves ⋮ Shortest color-spanning intervals ⋮ Computing the Fréchet distance between uncertain curves in one dimension ⋮ Computing the Fréchet distance between uncertain curves in one dimension

This page was built for publication: Tight Approximation Bounds for Connectivity with a Color-Spanning Set