Abstract
We give a simple framework as an alternative to the celebrated shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms with good approximation bounds for numerous optimization problems in low-dimensional Euclidean space. Our framework does not require the input graph/metric to have a geometric realization – it only requires that the input graph satisfy some weak property referred to as growth boundedness. We show how to obtain polynomial time approximation schemes (PTAS) for maximum (weighted) independent set problem on this graph class. Via a more sophisticated application of our framework, we also show how to obtain a PTAS for the maximum (weighted) independent set for intersection graphs of (low-dimensional) fat objects that are expressed without geometry.
Supported by Alberta Ingenuity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aspnes, J., Goldenberg, D., Yang, Y.: 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)
Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46(2), 178–189 (2003)
Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum indepen- dent set of pseudo-disks. In: SoCG (2009)
Chintalapudi, K., Govindan, R., Sukhatme, G., Dhariwal, A.: Ad-hoc localization using ranging and sectoring. In: INFOCOM (2004)
Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 34(6), 1302–1323 (2005)
Erlebach, T., van Leeuwen, E.J.: Approximating geometric coverage problems. In: SODA, pp. 1267–1276 (2008)
Flury, R., Pemmaraju, S.V., Wattenhofer, R.: Greedy routing with bounded stretch. In: INFOCOM (2009)
Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130–136 (1985)
Kuhn, F., Moscibroda, T., O’Dell, R., Wattenhofer, M., Wattenhofer, R.: Virtual coordinates for ad hoc and sensor networks. To appear in Algorithmica
Nieberg, T., Hurink, J., Kern, W.: Approximation schemes for wireless networks. ACM Transactions on Algorithms 4(4), 1–17 (2008)
Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: STOC, pp. 281–290. ACM, New York (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pirwani, I.A. (2009). Shifting Strategy for Geometric Graphs without Geometry. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)