scientific article; zbMATH DE number 6146439

DOI10.4230/LIPIcs.STACS.2008.1315zbMath1259.68239MaRDI QIDQ4910703

Julián Mestre

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c0f0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lagrangian relaxationpartial coverprimal-dual algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (7)

Partial multicovering and the \(d\)-consecutive ones property ⋮ A unified approach to approximating partial covering problems ⋮ On the generalized multiway cut in trees problem ⋮ Improved approximations for guarding 1.5-dimensional terrains ⋮ The checkpoint problem ⋮ Approximating node-weighted \(k\)-MST on planar graphs ⋮ Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth

This page was built for publication: