scientific article

zbMath1012.90053MaRDI QIDQ2768349

Aravind Srinivasan

Publication date: 17 June 2003

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

zbMATH Keywords

combinatorial optimizationapproximation algorithmspacking integer programscovering problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (8)

Approximation algorithms for the covering Steiner problem ⋮ Improved approximation algorithms for the spanning star forest problem ⋮ Geometric Packing under Nonuniform Constraints ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Dynamic programming based algorithms for set multicover and multiset multicover problems ⋮ Approximating Sparse Covering Integer Programs Online

This page was built for publication: