✦ LIBER ✦

A Polynomial-time Algorithm for the Bistable Roommates Problem

✍ Scribed by Jay Sethuraman; Chung-Piaw Teo

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 127 KB
Volume: 63
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.2001.1791

No coin nor oath required. For personal study only.

✦ Synopsis

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) results for the bistable marriage and roommates problem become transparent using the polyhedral approach. This technique has been used recently by the authors to address classical stable matching problems.

📜 SIMILAR VOLUMES

A polynomial algorithm for a constrained

A polynomial algorithm for a constrained traveling salesman problem

✍ J.H. Rubinstein; D.A. Thomas; N.C. Wormald 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

## Abstract We give a polynomial‐time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length. © 2001 John Wiley & Sons, Inc.

Polynomial time approximation algorithms

Polynomial time approximation algorithms for machine scheduling: ten open problems

✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 91 KB 👁 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy

A polynomial algorithm for thep-centdian

A polynomial algorithm for thep-centdian problem on a tree

✍ Tamir, Arie; P�rez-Brito, Dionisio; Moreno-P�rez, Jos� A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 2 views

The most common problems studied in network location theory are the p-median and the p-center models. The p-median problem on a network is concerned with the location of p points (medians) on the network, such that the total (weighted) distance of all the nodes to their respective nearest points is

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.

A polynomial time algorithm for finding

A polynomial time algorithm for finding the absolute center of a network

✍ Edward Minieka 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB

A Polynomial Time Algorithm for Diophant

A Polynomial Time Algorithm for Diophantine Equations in One Variable

✍ F CUCKER; P KOIRAN; S SMALE 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

We exhibit an algorithm computing, for a polynomial f ∈ Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .