✦ LIBER ✦

Graph partitions for the multidimensional assignment problem

✍ Scribed by Vogiatzis, Chrysafis; Pasiliao, Eduardo L.; Pardalos, Panos M.

Book ID: 121360160
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 882 KB
Volume: 58
Category: Article
ISSN: 0926-6003
DOI: 10.1007/s10589-013-9619-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Multidimensional Assignment Problem

✍ William P. Pierskalla 📂 Article 📅 1968 🏛 INFORMS 🌐 English ⚖ 605 KB

Erratum: The Multidimensional Assignment

Erratum: The Multidimensional Assignment Problem

✍ William P. Pierskalla 📂 Article 📅 1969 🏛 INFORMS 🌐 English ⚖ 77 KB

New Heuristics for the Multidimensional

New Heuristics for the Multidimensional Vote Assignment Problem

✍ P. Kleinschmidt; C. Rank 📂 Article 📅 1999 🏛 Springer Vienna 🌐 English ⚖ 133 KB

The optimal graph partitioning problem

✍ Søren Holm; Michael Malmros Sørensen 📂 Article 📅 1993 🏛 Springer 🌐 German ⚖ 791 KB

The bottleneck graph partition problem

✍ Hochbaum, Dorit S.; Pathria, Anu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB 👁 2 views

The bottleneck graph partition problem is to partition the nodes of a graph into two equally sized sets, so that the maximum edge weight in the cut separating the two sets is minimum. Whereas the graph partition problem, where the sum of the edge weights in the cut is to be minimized, is NP-hard, th

Algorithms for the minimum partitioning

Algorithms for the minimum partitioning problems in graphs

✍ Hiroshi Nagamochi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen