Approximation of geometric dispersion problems-Reference-Cited by-同舟云学术

Approximation of geometric dispersion problems

Published:1998 Issue: Volume: Page:63-75
ISSN:0302-9743
Container-title:Approximation Algorithms for Combinatiorial Optimization
language:
Short-container-title:

Author:

Baur Christoph,Fekete Sándor P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0053964

Reference40 articles.

1. B. S. Baker, D. J. Brown and H. K. Katseff. A 5/4 algorithm for two-dimensional packing, Journal of Algorithms, 2, 1981, 348–368.

2. Christoph Baur. Packungs-und Dispersionsprobleme. Diplomarbeit, Mathematisches Institut, UniversitÄt zu Köln, 1997.

3. J. E. Beasley. An exact two-dimensional non-guillotine cutting tree search procedure, Operations Research, 33, 1985, 49–64.

4. M. Bern and D. Eppstein. Clustering. Section 8.5 of the chapter Approximation algorithms for geometric problems, in: D. Hochbaum (ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing, 1996.

5. B. K. Bhattacharya and M. E. Houle. Generalized maximum independent set for trees. To appear in: Journal of Graph Algorithms and Applications, 1997. mike@cs.newcastle.edu.au.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Away from Each Other;WALCOM: Algorithms and Computation;2023

2. Dispersion on Intervals;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2022-09-01

3. An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position;IEICE Transactions on Information and Systems;2022-03-01

4. Max-Min 3-Dispersion Problems;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2021-09-01

5. Dispersing and grouping points on planar segments;Theoretical Computer Science;2021-09