Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/open-problems-13-NwTCl8zBtG
References (10)
-
Joseph Mitchell (1996)
Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem -
W. Gasarch (1991)
On Selecting the k Largest with Restricted Quadratic QueriesInf. Process. Lett., 38
-
E. Reingold (1971)
Computing the Maximum and the Median -
(1995)
I conjecture t ha t there is an O(n 2) algori thm (ignoring log terms) for min imum cost perfect matching. R e f e r e n c e s -
Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, J. Tromp, Louxin Zhang (1997)
On distances between phylogenetic trees -
P. Agarwal, A. Efrat, M. Sharir (1995)
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications -
A. Aggarwal, A. Bar-Noy, S. Khuller, Dina Kravets, B. Schieber (1995)
Efficient Minimum Cost Matching and Transportation Using the Quadrangle InequalityJ. Algorithms, 19
-
P. Vaidya (1989)
Geometry helps in matchingSIAM J. Comput., 18
-
Frank Fussenegger, H. Gabow (1979)
A Counting Approach to Lower Bounds for Selection ProblemsJ. ACM, 26
-
Avrim Blum, P. Chalasani, S. Vempala (1995)
A constant-factor approximation for the k-MST problem in the plane
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1996 by ACM Inc.
- ISSN
- 0163-5700
- DOI
- 10.1145/235767.571634
- Publisher site
- See Article on Publisher Site
Abstract
Open Problems: 13 S a m i r Khuller D e p a r t m e n t of C o m p u t e r Science University of M a r y l a n d , College P a r k , M D 20742 samir@cs.umd.edu I first provide an u p d a t e r e g a r d i n g the s t a t u s of some of the p r o b l e m s t h a t have a p p e a r e d in previous columns. . Nearest Neighbor Interchange Distance (SIGACT News Vol 25 (4) page 46 (1994)) Given two u n o r d e r e d b i n a r y trees (rooted or u n r o o t e d ) each w i t h leaves labeled 1, 2, .., n. T h e p r o b l e m is to d e t e r m i n e the n u m b e r of "nearest neighbor interchanges" needed to t r a n s f o
Journal
ACM SIGACT News – Association for Computing Machinery
Published: Jul 1, 1996