✦ LIBER ✦

A tight lower bound for the train reversal problem

✍ Scribed by Alok Aggarwal; Tom Leighton

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 319 KB
Volume: 35
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90032-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound for the Shortest Path Prob

A Lower Bound for the Shortest Path Problem

✍ Ketan Mulmuley; Pradyut Shah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 183 KB

A tight lower bound for the Steiner rati

A tight lower bound for the Steiner ratio in Minkowski planes

✍ Biao Gao; Ding-Zhu Du; Ronald L. Graham 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 804 KB

A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of

Tight Bounds for the Maximum Acyclic Sub

Tight Bounds for the Maximum Acyclic Subgraph Problem

✍ Bonnie Berger; Peter W Shor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Given a directed graph G s V, A , the maximum acyclic subgraph problem is to Ž . find a maximum cardinality subset AЈ of the arcs such that GЈ s V, AЈ is acyclic. In this paper, we present polynomial-time and RNC algorithms which, when given Ž any graph G without two-cycles, find an acyclic subgraph

A new lower bound for the quadratic assi

A new lower bound for the quadratic assignment problem

✍ S.I. Sergeyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 549 KB

Tight comparison bounds for the string p

Tight comparison bounds for the string prefix-matching problem

✍ Dany Breslauer; Livio Colussi; Laura Toniolo 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 621 KB

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of a simplicial graph

✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It