Geometric systems of disjoint representatives

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

Volumn 2528 LNCS, Issue , 2002, Pages 110-117

  Fiala, Jiří ^a   Kratochvíl, Jan ^a   Proskurowski, Andrzej ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

DISCRETE SPACES; EUCLIDEAN METRICS; GEOMETRIC PROBLEMS; GEOMETRIC SYSTEMS; HIGHER DIMENSIONS; MAP-LABELING; METRIC SPACES; POLYNOMIAL-TIME;

DRAWING (GRAPHICS);

EID: 84867437705     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36151-0_11     Document Type: Conference Paper

References (8)

1. Aharoni, R., P. Haxell, Hall's theorem for hypergraphs, J. Graph Th. 35, (2000), pp. 83-88.
2. Doddi S., M. V. Marathe, A. Mirzaian, B. M. E. Moret, B. Zhu, Map labeling and its generalizations. Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, (1997), pp. 148-157.
3. Edmonds, J., Paths, trees and flowers, Can. J. Math. 17, (1965), pp. 449-467.
4. Fiala, J., J. Kratochvíl, A. Proskurowski, Systems of sets and their representatives, manuscript 2002.
5. Hall, P., On representatives of subsets, J. London Math. Soc. 10, (1935), pp. 26-30.
6. Kratochvíl, J., A special planar satisfiability problem and a consequence of its NP-completeness, Discrete Appl. Math. 52, (1994), pp. 233-252.
7. Marks, J., S. Shieber, The computational complexity of cartographic label placement, Technical Report TR-05-91, Harvard CS, 1991.
8. Simons, B., A fast algorithm for single processor scheduling, Proc. 19th Symp. Foundations of Computer Science, (1978), pp. 246-252.