The minimum-area spanning tree problem

Lecture Notes in Computer Science

Volumn 3608, Issue , 2005, Pages 195-204

  Carmi, Paz ^a   Katz, Matthew J ^a   Mitchell, Joseph S B ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SENSORS; SET THEORY;

MINIMUM-AREA RANGE ASSIGNMENT (MARA); MINIMUM-AREA SPANNING TREE (MAST); MINIMUM-AREA TOUR (MAT); RADIO NETWORKS;

TREES (MATHEMATICS);

EID: 26844449888     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11534273_18     Document Type: Conference Paper

References (11)

1. B. Ábrego, G. Araujo, E. Arkin, S. Fernández, F. Hurtado, M. Kano, J.S.B. Mitchell, E. O. na Pulido, E. Rivera-Campo, J. Urrutia, and P. Valencia. Matching points with geometric objects. Manuscript, Universitat Politècnica de Catalunya, Nov. 2003.
2. T. Andreae. On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Tech. Report 74, Mathematisches Seminar, University of Hamburg, 1998.
3. T. Andreae and H.-J. Bandelt. Performance guarantees for approximation algorithms depending on parameterized triangle inequalities. SIAM Journal of Discrete Mathematics, 8(1):1-16, 1995.
4. M.A. Bender and C. Chekuri. Performance guarantees for the tsp with a parameterized triangle inequality. Inf. Process. Lett., 73(1-2):17-21, 2000.
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. MIT Press, 2001.
6. A.E.F. Clementi, P. Penna, and R. Silvestri. On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity, 2000.
7. D. Eppstein. Spanning trees and spanners. Handbook of Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier, 1999, pp. 425-461.
8. M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
9. R.L. Graham and P. Hell. On the history of the minimum spanning tree problem. Annals of the History of Computing, 7:43-57, 1985.
10. L.M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks. 14th Annual Sympos. Theoretical Aspects of Computer Science (STACS), LNCS 1200, 363-374, 1997.
11. T.A. McKee and F. R. McMorris. Topics in intersection graph theory. Volume 2 of Monographs on Discrete Mathematics and Applications, SIAM, 1999.