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