A semidefinite programming approach to tensegrity theory and realizability of graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 766-775

  So, Anthony Man Cho ^a   Ye, Yinyu ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EQUILIBRIUM STRESSES; OPTIMAL DUAL MULTIPLIERS; SEMIDEFINITE PROGRAMMING (SDP); TENSEGRITY FRAMEWORKS;

ALGORITHMS; CHARACTERIZATION; LINEAR PROGRAMMING; POLYNOMIALS; SET THEORY;

GRAPH THEORY;

EID: 33244496941     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109641     Document Type: Conference Paper

References (34)

1. Abdo Y. Alfakih, Henry Wolkowicz. On the Embeddability of Weighted Graphs in Euclidean Spaces. Research Report CORR 98-12, University of Waterloo, Dept. of Combinatorics and Optimization, 1998.
2. Abdo Y. Alfakih, Henry Wolkowicz. Euclidean Distance Matrices and the Molecular Conformation Problem. Research Report CORR 2002-17, University of Waterloo, Dept. of Combinatorics and Optimization, 2002.
3. Farid Alizadeh. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization. SIAM J. Opt. 5(1):13-51, 1995.
4. Stefan Arnborg, Andrzej Proskurowski. Characterization and Recognition of Partial 3-Trees. SIAM J. Alg. Disc. Meth. 7(2):305-314, 1986.
5. Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil. Forbidden Minors Characterization of Partial 3-Trees. Disc. Math. 80:1-19, 1990.
6. Takao Asano. An Approach to the Subgraph Homeomorphism Problem. Theor. Comput. Sci. 38:249-267, 1985.
7. James Aspnes, David Goldenberg, Yang Richard Yang. On the Computational Complexity of Sensor Network Localization. Proc. 1st ALGOSENSORS, in LNCS 3121:32-44, 2004.
8. Mihai Bǎdoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk. Low-Dimensional Embedding with Extra Information. Proc. 20th SoCG, 2004.
9. A. I. Barvinok. Problems of Distance Geometry and Convex Properties of Quadratic Maps. Disc. Comput. Geom. 13:189-202, 1995.
10. Pratik Biswas, Tzu-Chen Liang, Kim-Chuan Toh, Yinyu Ye. An SDP Based Approach for Anchor-Free 3D Graph Realization. Preprint, 2005.
11. Pratik Biswas, Yinyu Ye. Semidefinite Programming for Ad Hoc Wireless Sensor Network Localization. Proc. 3rd IPSN, 2004.
12. Steven J. Benson, Yinyu Ye, Xiong Zhang. Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization. SIAM J. Opt. 10(2):443-461, 2000.
13. Robert Connelly. Rigidity and Energy. Invent. Math. 66:11-33, 1982.
14. Robert Connelly, Maria Sloughter. Realizability of Graphs. Preprint, 2004.
15. Trevor F. Cox, Michael A. A. Cox. Multidimensional Scaling (2nd Edition). Chapman & Hall/CRC, 2000.
16. Gordon M. Crippen, Timothy F. Havel. Distance Geometry and Molecular Conformation. John Wiley & Sons, Inc., 1988.
17. Reinhard Diestel. Graph Theory (2nd Edition). Graduate. Texts in Mathematics Volume 173, Springer-Verlag, 2000.
18. Lance Doherty, Kristofer S. J. Pister, Laurent El Ghaoui. Convex Position Estimation in Wireless Sensor Networks. Proc. 20th INFOCOM, 2001.
19. Christoph Helmberg. Semidefinite Programming for Combinatorial Optimization. ZIB-Report ZR-00-34, Konrad-Zuse-Zentrum Berlin, 2000.
20. Bruce Hendrickson. The Molecule Problem: Exploiting Structure in Global Optimization. SIAM J. Opt. 5(4):835-857, 1995.
21. J. E. Hopcroft, R. E. Tarjan. Dividing a Graph into Triconnected Components. SIAM J. Comput. 2(3):135-158, 1973.
22. Roger A. Horn, Charles R. Johnson. Matrix Analysis. Cambridge University Press, 1985.
23. Jiff Matoušek, Robin Thomas. Algorithms Finding Tree-Decompositions of Graphs. J. Algorithms 12(1):1-22, 1991.
24. Jorge J. Moré, Zhijun Wu. Global Continuation for Distance Geometry Problems. SIAM J. Opt. 7:814-836, 1997.
25. Neil Robertson, P. D. Seymour. Graph Minors. XX. Wagner's Conjecture. J. Comb. Theory, Ser. B 92:325-357, 2004.
26. Donald J. Rose. On Simple Characterizations of k-Trees. Disc. Math. 7:317-322, 1974.
27. B. Roth, W. Whiteley. Tensegrity Frameworks. Trans. AMS 265(2):419-446, 1981.
28. J. B. Saxe. Embeddability of Weighted Graphs in k-Space is Strongly NP-Hard. Proc. 17th Allerton Conf. Commun. Control Comput., 1979.
29. I. J. Schoenberg. Remarks to Maurice Fréchet's Article "Sur la Définition Axiomatique d'une Classe d'Espace Distanciés Vectoriellement Applicable sur l'Espace de Hilbert". Ann. Math. 36(3):724-732, 1935.
30. Yi Shang, Wheeler Ruml. Improved MDS-Based Localization. Proc. 23rd INFOCOM, 2004.
31. Maria Sloughter. Realizability of Graphs in Three Dimensions. Preprint, 2004.
32. Anthony Man-Cho So, Yinyu Ye. Theory of Semidefinite Programming in Sensor Network Localization. Proc. 16th SODA, 2005.
33. Lieven Vandenberghe, Stephen Boyd. Semidefinite Programming. SIAM Review 38(1):49-95, 1996.
34. G. Young, A. S. Householder. Discussion of a Set of Points in terms of Their Mutual Distances. Psychometrika 3:19-22, 1938.