𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

✍ Scribed by Anders Dessmark; Jesper Jansson; Andrzej Lingas; Eva-Marta Lundell

Publisher
Springer
Year
2007
Tongue
English
Weight
230 KB
Volume
48
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On polynomial-time approximation algorit
On polynomial-time approximation algorithms for the variable length scheduling problem
✍ Artur Czumaj; Leszek GaΜ§sieniec; Daya Ram Gaur; Ramesh Krishnamurti; Wojciech Ry πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 195 KB

This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), ( 2001) 569-582) where they deal with the variable length scheduling problem (VLSP) with parameters k1; k2, denoted VLSP(k1; k2). In the current paper, we ΓΏrst discuss a

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