Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/B99805MaRDI QIDQ5313045zbMATH OpenOpenAlexFDO

Authors Piotr Berman, Bhaskar Dasgupta, Eduardo D. Sontag

Publication date 25 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99805

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
• Randomized approximation of bounded multicovering problems
• One for the price of two: a unified approach for approximating covering problems
• Randomized approximation for the set multicover problem in hypergraphs
• Approximation algorithm for the multicovering problem

Cited in

(9)

• Hyperbolic set covering problems with competing ground-set elements
• Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
• Computational Methods in Systems Biology
• On Approximating an Implicit Cover Problem in Biology
• Efficient design of compact unstructured RNA libraries covering all \(k\)-mers
• Parameterized lower bound and inapproximability of polylogarithmic string barcoding
• Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer
• Molecular systems biology and control
• Approximating set multi-covers

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5313045)