scientific article; zbMATH DE number 1953104
From MaRDI portal
Publication:4414508
zbMath1022.90036MaRDI QIDQ4414508
Diana Poensgen, S. S. Ravi, Madhav V. Marathe, Hans-Christoph Wirth, Sven O. Krumke
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730321.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmtreewidthinteger linear programmingmaximum weight matchingbudgeted maximum coverage
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
The generalized maximum coverage problem ⋮ An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees
This page was built for publication:
