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

The minimum evolution problem: Overview and classification

โœ Scribed by Daniele Catanzaro

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
181 KB
Volume
53
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimum-cost strong network orientation
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
โœ Burkard, Rainer E.; Feldbacher, Karin; Klinz, Bettina; Woeginger, Gerhard J. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 184 KB

In the minimum-cost strong network orientation problem (MCSO), we are given an undirected graph G ร… (V, E) with nonnegative edge lengths แ‰(e) and a transportation schedule T ร… {(s 1 , t 1 , w 1 ), . . . , (s k , t k , w k )}, where w i units of weight have to be transported from the source vertex s

On the minimum vocabulary problem
On the minimum vocabulary problem
โœ Chandrasekharan, N. ;Sridhar, R. ;Iyengar, S.S. ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 557 KB

The "minimum vocabulary problem" for a dictionary has applications in indexing and other domains of information retrieval. A simple directed-graph model of a dictionary results in a linear-time algorithm for this problem. Since it is known that many minimum vocabularies can exist for a dictionary, a

The minimum dummy task problem
The minimum dummy task problem
โœ Jeremy Spinrad ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 879 KB

The problem of minimizing the number of dummy tasks in a PERT network was shown to be NP-complete by Krishnamoorthy and Deo [9]. Previous methods of dealing with this problem have imposed extra restrictions on the solution [2,4] or have considered "good" exponential algorithms to solve the problem [