Amanote Research
Register
Sign In
Approximation Algorithms Design for Disk Partial Covering Problem
doi 10.1109/ispan.2004.1300466
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2004
Authors
E.H.-M. Sha
Publisher
IEEE
Related search
Approximation Algorithms for Partial Covering Problems*1
Journal of Algorithms
Approximation Algorithms for the Shortest Superstring Problem.
Improved Approximation Algorithms for Firefighter Problem on Trees
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
Approximation Algorithms for the Multiprocessor Open Shop Scheduling Problem
Operations Research Letters
Industrial
Applied Mathematics
Manufacturing Engineering
Management Science
Operations Research
Software
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Efficiency Comparison of Exact and Approximate Algorithms for Solving Set Covering Problem
Vestnik of Don State Technical University
Computational Experiments With Some Approximation Algorithms for the Travelling Salesman Problem
Applicationes Mathematicae
Approximation Algorithms and Hardness of Thek-Route Cut Problem
ACM Transactions on Algorithms
Mathematics
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems
