|
| Keyword : approximation algorithm
| |
|
Worst Case Analysis of Approximation Algorithm of Abrams et al. for the Set k-Cover Problem
Satoshi FUJITA | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2014/03/01
Vol. E97-D
No. 3 ;
pp. 399-405
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science —New Trends in Theory of Computation and Algorithm—)
Category: Optimizing Algorithms, Parallel and Distributed Computing
Keyword:
Set k-cover, approximation algorithm, upper bound on the performance ratio, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
|
