𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A faster algorithm for the two-center decision problem

✍ Scribed by John Hershberger

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
569 KB
Volume
47
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

AnO(log*n) Approximation Algorithm for t
AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
✍ Rina Panigrahy; Sundar Vishwanathan πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 130 KB

The input to the asymmetric p-center problem consists of an integer p and an n = n distance matrix D defined on a vertex set V of size n, where d gives the i j distance from i to j. The distances are assumed to obey the triangle inequality. For a subset S : V the radius of S is the minimum distance