Multiobjective disk cover admits a PTAS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5369 LNCS, Issue , 2008, Pages 40-51

  Glaßer, Christian ^a   Reitwießner, Christian ^a   Schmitz, Heinz ^b  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b TRIER UNIVERSITY OF APPLIED SCIENCES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BASE STATIONS; CUSTOMER SATISFACTION; DISKS (MACHINE COMPONENTS); DISKS (STRUCTURAL COMPONENTS); POLYNOMIAL APPROXIMATION; SALES;

APPROXIMABILITY; APPROXIMATION SCHEMES; COVER PROBLEMS; MULTI OBJECTIVES; MULTI-OBJECTIVE PROBLEMS; SINGLE OBJECTIVE;

MULTIOBJECTIVE OPTIMIZATION;

EID: 58549088753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92182-0_7     Document Type: Conference Paper

References (23)

1. Alt, H., Arkin, E.M., Brönnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Symposium on Computational Geometry, pp. 449-458 (2006)
2. Angel, E., Bampis, E., Kononov, A.: A FPTAS for approximating the unrelated parallel machines scheduling problem with costs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 194-205. Springer, Heidelberg (2001)
3. Angel, E., Bampis, E., Kononov, A.: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theoretical Computer Science 306(1-3), 319-338 (2003)
4. Ben-Moshe, B., Carmi, P., Katz, M.J.: Approximating the visible region of a point on a terrain. GeoInformatica 12(1), 21-36 (2008)
5. Calinescu, G., Mandoiu, I.I., Wan, P.-J., Zelikovsky, A.: Selecting forwarding neighbors in wireless ad hoc networks. MONET 9(2), 101-111 (2004)
6. Cannon, A.H., Cowen, L.J.: Approximation algorithms for the class cover problem. Annals of Mathematics and Artificial Intelligence 40(3-4), 215-223 (2004)
7. Carmi, P., Katz, M.J., Lev-Tov, N.: Covering points by unit disks of fixed location. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 644-655. Springer, Heidelberg (2007)
8. Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. Journal of Algorithms 46(2), 178-189 (2003)
9. Cheng, T.C.E., Janiak, A., Kovalyov, M.Y.: Bicriterion single machine scheduling with resource dependent processing times. SIAM Journal on Optimization 8(2), 617-630 (1998)
10. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86(1-3), 165-177 (1990)
11. Diakonikolas, I., Yannakakis, M.: Small approximate pareto sets for bi-objective shortest paths and other problems. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 74-88. Springer, Heidelberg (2007)
12. Dongarra, J., Jeannot, E., Saule, E., Shi, Z.: Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. In: Proceedings 19th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 280-288. ACM, New York (2007)
13. Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005)
14. Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM Journal on Computing 34(6), 1302-1323 (2005)
15. Erlebach, T., van Leeuwen, E.J.: Approximating geometric coverage problems. In: Proceedings of 19th Annual Aymposium on Discrete Algorithms, pp. 1267-1276 (2008)
16. Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55-84 (2004)
17. Glaßer, C., Reith, S., Vollmer, H.: The complexity of base station positioning in cellular networks. Discrete Applied Mathematics 148(1), 1-12 (2005)
18. Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM 32, 130-136 (1985)
19. Narayanappa, S., Vojtechovsky, P.: An improved approximation factor for the unit disk covering problem. In: CCCG (2006)
20. Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: FOCS, pp. 86-92 (2000)
21. Safer, H.M., Orlin, J.B.: Fast approximation schemes for multi-criteria combinatorial optimization. Working papers 3756-95, Massachusetts Institute of Technology, Sloan School of Management (1995)
22. Safer, H.M., Orlin, J.B.: Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. Working papers 3757-95, Massachusetts Institute of Technology, Sloan School of Management (1995)
23. Vassilvitskii, S., Yannakakis, M.: Efficiently computing succinct trade-off curves. Theoretical Computer Science 348(2-3), 334-356 (2005)