✦ LIBER ✦

Solving the minimum-weighted coloring problem

✍ Scribed by Massimiliano Caramia; Paolo Dell'Olmo

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 192 KB
Volume: 38
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.1028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the undirected minimum cost flow

Solving the undirected minimum cost flow problem with arbitrary costs

✍ A. Sedeño-Noda; C. González-Martín; S. Alonso 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB

## Abstract We address the undirected minimum cost flow problem with arbitrary arcs costs. Any optimal solution for this problem is characterized by the property that the flow of each arc with negative cost must be equal to its capacity. That is, the flow can be nonzero in both directions. This sit

A CAD approach to the minimum weight des

A CAD approach to the minimum weight design problem

✍ Björn J. D. Esping 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 492 KB

Solving minimum K-cardinality cut proble

Solving minimum K-cardinality cut problems in planar graphs

✍ Maurizio Bruglieri; Francesco Maffioli; Marco Trubian 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB

A primal-dual algorithm for the minimum

A primal-dual algorithm for the minimum average weighted length circuit problem

✍ Chengen Yang; Dayong Jin 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 327 KB 👁 1 views

Solving the eyewitness problem

✍ Dr. Edith Greene; Elizabeth F. Loftus 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 799 KB

An efficiently solvable case of the mini

An efficiently solvable case of the minimum weight equivalent subgraph problem

✍ M. B. Richey; R. Gary Parker; R. L. Rardin 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB