𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Set LCS and Set-Set LCS Problems

✍ Scribed by B.F. Wang; G.H. Chen; K. Park

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
431 KB
Volume
14
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

We consider two generalizations of the longest common subsequence (LCS) problem: the Set LCS problem and the Set-Set LCS problem. We present algorithms for the two problems that are faster than the previous ones by Hirschberg and Larmore. 1993 Academic Press, Inc.

πŸ“œ SIMILAR VOLUMES

cover
Panic on the Set - Panik am Set
✍ Tina Zang πŸ“‚ Fiction πŸ“… 2015;2010 πŸ› Langenscheidt KG 🌐 German βš– 269 KB πŸ‘ 2 views

Eine englische Produktionsfirma dreht auf der Halbinsel Darss einen Jugendfilm, fΓΌr den noch Statisten gesucht werden. Beim Casting ergattert die 11-jΓ€hrige Cora eine kleine Rolle und verbringt daraufhin ihre Sommerferien mit dem Filmteam.

On Crossing Sets, Disjoint Sets, and Pag
On Crossing Sets, Disjoint Sets, and Pagenumber
✍ Farhad Shahrokhi; Weiping Shi πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 109 KB

Let G s V, E be a t-partite graph with n vertices and m edges, where the Ε½ 2 1.5 . partite sets are given. We present an O n m time algorithm to construct drawings of G in the plane so that the size of the largest set of pairwise crossing Ε½ edges and, at the same time, the size of the largest set of

Note: On the set-union knapsack problem
Note: On the set-union knapsack problem
✍ Olivier Goldschmidt; David Nehme; Gang Yu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 558 KB
Probabilistic partial set covering probl
Probabilistic partial set covering problems
✍ Hanif D. Sherali; Seong-In Kim; Edna L. Parrish πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 563 KB