Spider covers and their applications

DOI10.5402/2012/347430zbMath1257.90082OpenAlexW2152092782WikidataQ58691001 ScholiaQ58691001MaRDI QIDQ1935978

Luisa Gargano, Alberto Negro, Filomena De Santis, Ugo Vaccaro, Mikael Hammar

Publication date: 21 February 2013

Published in: ISRN Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5402/2012/347430

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning spiders and light-splitting switches
• An approximation algorithm for the directed telephone multicast problem
• A threshold of ln n for approximating set cover
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Special cases of traveling salesman and repairman problems with time windows
• An analysis of approximations for maximizing submodular set functions—I
• On approximating a geometric prize-collecting traveling salesman problem with time windows
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: Spider covers and their applications