scientific article; zbMATH DE number 2038708
From MaRDI portal
Publication:4449173
zbMath1060.68694MaRDI QIDQ4449173
Aravind Srinivasan, Samir Khuller, Rajiv Gandhi, Eran Halperin, Guy Kortsarz
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190164.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programmingApproximation algorithmsrandomized roundingvertex coverset covercapacitated covering
Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
Capacitated Arc Stabbing ⋮ A PTAS for the cardinality constrained covering with unit balls ⋮ Linear time algorithms for approximating the facility terminal cover problem ⋮ Randomized Rounding in the Presence of a Cardinality Constraint
This page was built for publication:
