✦ LIBER ✦

A Faster FPT Algorithm for the Maximum Agreement Forest Problem

✍ Scribed by Michael Hallett; Catherine McCartin

Publisher: Springer
Year: 2007
Tongue: English
Weight: 246 KB
Volume: 41
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-007-1329-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A faster algorithm for the maximum weigh

A faster algorithm for the maximum weighted tardiness problem

✍ Malcolm C. Fields; Greg N. Frederickson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Polynomial-Time Algorithms for the Order

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

✍ Anders Dessmark; Jesper Jansson; Andrzej Lingas; Eva-Marta Lundell 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 230 KB

A faster optimal algorithm for the measu

A faster optimal algorithm for the measure problem

✍ Stephan Olariu; Zhaofang Wen; Weixiong Zhang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 238 KB

A Faster Algorithm for the Inverse Spann

A Faster Algorithm for the Inverse Spanning Tree Problem

✍ Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 149 KB

In this paper, we consider the inverse spanning tree problem. Given an undi-0 Ž 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0 , the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tre

A faster algorithm for the two-center de

A faster algorithm for the two-center decision problem

✍ John Hershberger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 569 KB

A faster polynomial algorithm for the un

A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

✍ Ulrich Brenner 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 320 KB

We present a new algorithm for the Hitchcock transportation problem. On instances with n sources and k sinks, our algorithm has a worst-case running time of O(nk 2 (log n + k log k)). It closes a gap between algorithms with running time linear in n but exponential in k and a polynomialtime algorithm