✦ LIBER ✦

A linear time algorithm for the reverse 1-median problem on a cycle

✍ Scribed by Rainer E. Burkard; Elisabeth Gassner; Johannes Hatzl

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 142 KB
Volume: 48
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20115

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for the minmax reg

An improved algorithm for the minmax regret median problem on a tree

✍ Igor Averbakh; Oded Berman 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a “minmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because

A Constant-Factor Approximation Algorith

A Constant-Factor Approximation Algorithm for the k-Median Problem

✍ Moses Charikar; Sudipto Guha; Éva Tardos; David B. Shmoys 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most wellstudied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are rel

A linear-time algorithm for the k-fixed-

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

✍ Katerina Asdre; Stavros D. Nikolopoulos 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

A branch-and-price algorithm for the cap

A branch-and-price algorithm for the capacitated p-median problem

✍ Alberto Ceselli; Giovanni Righini 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract The capacitated __p__‐median problem is the variation of the well‐known __p__‐median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We

A Polynomial-time Algorithm for the Bist

A Polynomial-time Algorithm for the Bistable Roommates Problem

✍ Jay Sethuraman; Chung-Piaw Teo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

A polynomial algorithm for the Hamiltoni

A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

✍ Bang-Jensen, J�rgen; Gutin, Gregory; Yeo, Anders 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence of such an algorithm was conjectured in G.