๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A polynomial time algorithm for constructing the refined Buneman tree

โœ Scribed by D. Bryant; V. Moulton

Book ID
104350165
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
324 KB
Volume
12
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A polynomial time algorithm for rectilin
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves
โœ Brazil, M.; Thomas, D. A.; Weng, J. F. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 168 KB ๐Ÿ‘ 2 views

The rectilinear Steiner problem is the problem of constructing the shortest rectilinear network in the plane connecting a given set of points, called terminals. The problem is known to be NP-complete in general. In this paper, we show that there is a polynomial time algorithm for solving the rectili

A Polynomial-time Algorithm for the Bist
A Polynomial-time Algorithm for the Bistable Roommates Problem
โœ Jay Sethuraman; Chung-Piaw Teo ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result