Good quality virtual realization of unit ball graphs

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

Volumn 4698 LNCS, Issue , 2007, Pages 311-322

  Pemmaraju, Sriram V ^a   Pirwani, Imran A ^a  

^a University of Iowa   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH THEORY; LINEAR PROGRAMMING; PROBLEM SOLVING; TWO DIMENSIONAL;

COMBINATORIAL ALGORITHM; HIGHER DIMENSIONAL SPACE; MINIMUM CLIQUE COVER PROBLEM;

VIRTUAL REALITY;

EID: 38049054197     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_29     Document Type: Conference Paper

References (13)

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.) ALGOSEN-SORS 2004. LNCS, vol. 3121, pp. 32-44. Springer, Heidelberg (2004)
2. Basu, A., Gao, J., Mitchell, J.S.B., Sabhnani, G.: Distributed localization using noisy distance and angle information. In: MobiHoc '06: Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing, pp. 262-273. ACM Press, New York, USA (2006)
3. Bruck, J., Gao, J., Jiang, A.(A).: Localization and routing in sensor networks by local angle information. In: MobiHoc '05: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing, pp. 181-192. ACM Press, New York, NY, USA (2005)
4. Feige, U.: Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci. 60(3), 510 539 (2000)
5. Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp. 682-690. ACM Press, New York, USA (1993)
6. Krauthgamer, R., Lee, J.R.: The intrinsic dimensionality of graphs. In: STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp. 438-447. ACM Press, New York, NY, USA (2003)
7. Kuhn, F., Moscibroda, T., O'Dell, R., Wattenhofer, M., Wattenhofer, R.: Virtual coordinates for ad hoc and sensor networks. Algorithmica (to appear 2006)
8. Linial, N.: Variation on a theme of Levin. In: Matoušek, J. (ed.) Open Problems, Workshop on Discrete Metric Spaces and their Algorithmic Applications (2002)
9. Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 215-245 (1995)
10. Moscibroda, T., O'Dell, R.. Wattenhofer, M., Wattenhofer, R.: Virtual coordinates for ad hoc and sensor networks. In: DIALM-POMC '04: Proceedings of the 2004 joint workshop on Foundations of mobile computing, pp. 8 16. ACM Press, New York, NY, USA (2004)
11. Raghavan, V., Spinrad, J.: Robust algorithms for restricted domains. In: SODA '01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp, 460-467. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2001)
12. Rao, S.: Small distortion and volume preserving embeddings for planar and euclidean metrics. In: SCG '99: Proceedings of the fifteenth annual symposium on Computational geometry, pp. 300 306. ACM Press, New York, USA (1999)
13. Vempala, S.: Random projection: A new approach to VLSI layout. In: FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 389-395. IEEE Computer Society Press, Washington, DC. USA (1998)