Online Maximum k-Coverage

DOI10.1007/978-3-642-22953-4_16zbMath1342.68360OpenAlexW4233558432MaRDI QIDQ3088282

Vangelis Th. Paschos, Nicolas Boria, Giorgio Lucarelli, Giorgio Ausiello, Aristotelis Giannakos

Publication date: 19 August 2011

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22953-4_16

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)

Cites Work

• Online maximum \(k\)-coverage
• Clustering and domination in perfect graphs
• On approximation of max-vertex-cover
• The quadratic 0-1 knapsack problem with series-parallel support
• Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
• A threshold of ln n for approximating set cover
• Unnamed Item
• Unnamed Item

This page was built for publication: Online Maximum k-Coverage