scientific article; zbMATH DE number 1323125

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5" /><615::AID-NAV5>3.0.CO;2-5 10.1002/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5zbMath0938.90026MaRDI QIDQ4255028

Anu Pathria, Dorit S. Hochbaum

Publication date: 27 June 2000

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

zbMATH Keywords

covering\(k\)-stage covering algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35)

Related Items (31)

Siting renewable power generation assets with combinatorial optimisation ⋮ Approximation algorithms for maximum weight k-coverings of graphs by packings ⋮ Linear Time Approximation Schemes for Geometric Maximum Coverage ⋮ Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs ⋮ Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7 ⋮ Calculating approximation guarantees for partial set cover of pairs ⋮ Pairs Covered by a Sequence of Sets ⋮ Quotient geometric crossovers and redundant encodings ⋮ Matroid-constrained vertex cover ⋮ Unnamed Item ⋮ Relational data factorization ⋮ The gradual covering decay location problem on a network. ⋮ Interactive optimization of submodular functions under matroid constraints ⋮ Online maximum \(k\)-coverage ⋮ Inequalities on submodular functions via term rewriting ⋮ Online budgeted maximum coverage ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ The capacitated orienteering problem ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ Performance bounds with curvature for batched greedy optimization ⋮ The generalized maximal covering location problem ⋮ Mining representative subset based on fuzzy clustering ⋮ Maximum rooted connected expansion ⋮ Approximation algorithms for the connected sensor cover problem ⋮ Solving SAT in a distributed cloud: a portfolio approach ⋮ Online Maximum k-Coverage ⋮ Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer ⋮ Two-stage flexible-choice problems under uncertainty ⋮ Problems and algorithms for covering arrays via set covers ⋮ Online algorithms for the maximum \(k\)-interval coverage problem ⋮ Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems

This page was built for publication: