✦ LIBER ✦

Improved algorithms for largest cardinality 2-interval pattern problem

✍ Scribed by Erdong Chen; Linji Yang; Hao Yuan

Book ID: 106407082
Publisher: Springer US
Year: 2006
Tongue: English
Weight: 389 KB
Volume: 13
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-006-9030-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved update/query algorithms for the

Improved update/query algorithms for the interval valuation problem

✍ D.S. Hirschberg; Dennis James Volper 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 301 KB

A 2-approximation for the preceding-and-

A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem

✍ Minghui Jiang 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 188 KB

An Improved Randomized On-Line Algorithm

An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem

✍ Hiroyuki Miyazawa; Thomas Erlebach 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 237 KB

A fast expected time algorithm for the 2

A fast expected time algorithm for the 2-D point pattern matching problem

✍ P.B. Van Wamelen; Z. Li; S.S. Iyengar 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 379 KB

NOTE Improved Approximation Algorithms f

NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems

✍ Michal Penn; Haya Shasha-Krupnik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The problem of finding a minimum augmenting edge-set to make a graph k-vertex connected is considered. This problem is denoted as the minimum k-augmentation problem. For weighted graphs, the minimum k-augmentation problem is NP-complete. Our main result is an approximation algorithm with a performan

A simpleO(n2) algorithm for the all-pair

A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph

✍ Mirchandani, Prakash 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 3 views

Let G denote an interval graph with n vertices and unit weight edges. In this paper, we present a simple O(n') algorithm for solving the all-pairs shortest path problem on graph G . A recent algorithm for this problem has the same time-complexity but is fairly complicated to describe. However, our a