A weakly robust PTAS for minimum clique partition in unit disk graphs (extended abstract)

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

Volumn 6139 LNCS, Issue , 2010, Pages 188-199

  Pirwani, Imran A ^a   Salavatipour, Mohammad R ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENCY MATRICES; CLIQUE PARTITION; CONSTANT FACTOR APPROXIMATION; EDGE LENGTH; EXTENDED ABSTRACTS; INPUT MODELS; NP-HARD; ROBUST POLYNOMIALS; STANDARD FORM; UNIT DISK GRAPHS;

COMPUTATIONAL COMPLEXITY; DISKS (STRUCTURAL COMPONENTS); GRAPH THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 77954637431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13731-0_19     Document Type: Conference Paper

References (12)

1. Aspnes, J., Goldenberg, D.K., Yang, Y.R.: On the computational complexity of sensor network localization. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol. 3121, pp. 32-44. Springer, Heidelberg (2004)
2. Balasundaram, B., Butenko, S.: Optimization problems in unit-disk graphs. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2832-2844. Springer, Heidelberg (2009)
3. Capoyleas, V., Rote, G., Woeginger, G.J.: Geometric clusterings. J. Algorithms 12(2), 341-356 (1991)
4. Cerioli, M.R., Faria, L., Ferreira, T.O., Martinhon, C.A.J., Protti, F., Reed, B.: Partition into cliques for cubic graphs: Planar case, complexity and approximation. Discrete Applied Mathematics 156(12), 2270-2278 (2008)
5. Cerioli, M.R., Faria, L., Ferreira, T.O., Protti, F.: On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. Electronic Notes in Discrete Mathematics 18, 73-79 (2004)
6. Dumitrescu, A., Pach, J.: Minimum clique partition in unit disk graphs. CoRR, abs/0909.1552 (2009)
7. Finke, G., Jost, V., Queyranne, M., Sebö, A.: Batch processing with interval graph compatibilities between tasks. Discrete Applied Mathematics 156(5), 556-568 (2008) (Pubitemid 351248993)
8. Nieberg, T., Hurink, J., Kern, W.: Approximation schemes for wireless networks. ACM Transactions on Algorithms 4(4), 1-17 (2008)
9. Pandit, S., Pemmaraju, S., Varadarajan, K.: Approximation algorithms for domatic partitions of unit disk graphs. In: APPROX-RANDOM, pp. 312-325 (2009)
10. Pemmaraju, S.V., Pirwani, I.A.: Good quality virtual realization of unit ball graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 311-322. Springer, Heidelberg (2007)
11. Pirwani, I.A., Salavatipour, M.R.: A weakly robust PTAS for minimum clique partition in unit disk graphs. CoRR, abs/0904.2203 (2009)
12. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3(1), 103-128 (2007)