✦ LIBER ✦

O(n2.5) time algorithms for the subgraph homeomorphism problem on trees

✍ Scribed by Moon Jung Chung

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 346 KB
Volume: 8
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(87)90030-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O (n2) heuristic algorithm for the di

An O (n2) heuristic algorithm for the directed Steiner minimal tree problem

✍ J.MacGregor Smith; Judith S. Liebman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 827 KB

Two exact algorithms for the vehicle rou

Two exact algorithms for the vehicle routing problem on trees

✍ Pontien Mbaraga; André Langevin; Gilbert Laporte 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB 👁 2 views

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe

An O(m log n) algorithm for the max + su

An O(m log n) algorithm for the max + sum spanning tree problem

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 240 KB

An O(pn2) algorithm for the p-median and

An O(pn2) algorithm for the p-median and related problems on tree graphs

✍ Arie Tamir 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Computing the 2-median on tree networks

Computing the 2-median on tree networks in O(n lg n) time

✍ Bezalel Gavish; Suresh Sridhar 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 865 KB

An O(nlg k · 2n2) time and O(k · 2nk) sp

An O(nlg k · 2n2) time and O(k · 2nk) space algorithm for certain NP-complete problems

✍ Jozef Vyskoc̆ 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 741 KB