✦ LIBER ✦

On graphs with polynomially solvable maximum-weight clique problem

✍ Scribed by Egon Balas; Chang Sung Yu

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 319 KB
Volume: 19
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230190206

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the single-machine scheduling

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

✍ Suresh Chand; Hans Schneeberger 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th

A probabilistic local majority polling g

A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem

✍ Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB 👁 1 views

In this paper, we investigate a probabilistic local majority polling game on weighted directed graphs, keeping an application to the distributed agreement problem in mind. We formulate the game as a Markov chain, where an absorbing state corresponds to a system configuration that an agreement is ach