Amanote Research
Register
Sign In
Approximation Algorithms for Partial Covering Problems*1
Journal of Algorithms
doi 10.1016/s0196-6774(04)00068-9
Full Text
Open PDF
Abstract
Available in
full text
Date
May 1, 2004
Authors
R GANDHI
Publisher
Elsevier BV
Related search
Approximation Algorithms Design for Disk Partial Covering Problem
Fast Approximation Algorithms for Multicommodity Flow Problems
Approximation Algorithms for Multi-Dimensional Vector Assignment Problems
SSRN Electronic Journal
Partial Sample Average Approximation Method for Chance Constrained Problems
Optimization Letters
Control
Optimization
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
Sampling Sub-Problems of Heterogeneous Max-Cut Problems and Approximation Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms for General Packing Problems With Modified Logarithmic Potential Function
Covering Problems for Dichotomized Matching
Aequationes Mathematicae
Combinatorics
Mathematics
Applied Mathematics
Discrete Mathematics
