### Abstract

Original language | English |
---|---|

Title of host publication | Graph-Theoretic Concepts in Computer Science |

Subtitle of host publication | 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004. Revised Papers |

Editors | Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel |

Place of Publication | Berlin |

Publisher | Springer |

Pages | 189-200 |

Number of pages | 12 |

ISBN (Print) | 3-540-24132-9 |

DOIs | |

Publication status | Published - Jun 2004 |

Event | 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004 - Bad Honnef, Germany Duration: 21 Jun 2004 → 23 Jun 2004 Conference number: 30 |

### Publication series

Name | Lecture notes in computer science |
---|---|

Volume | 3353 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Workshop

Workshop | 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004 |
---|---|

Abbreviated title | WG |

Country | Germany |

City | Bad Honnef |

Period | 21/06/04 → 23/06/04 |

### Fingerprint

### Keywords

- CAES-EEA: Efficient Embedded Architectures
- EWI-1499
- IR-48397
- METIS-219813

### Cite this

*Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004. Revised Papers*(pp. 189-200). (Lecture notes in computer science; Vol. 3353). Berlin: Springer. https://doi.org/10.1007/978-3-540-30559-0_16, https://doi.org/10.1007/b104584

}

*Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004. Revised Papers.*Lecture notes in computer science, vol. 3353, Springer, Berlin, pp. 189-200, 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, Bad Honnef, Germany, 21/06/04. https://doi.org/10.1007/978-3-540-30559-0_16, https://doi.org/10.1007/b104584

**The Computational Complexity of the Minimum Weight Processor Assignment Problem.** / Broersma, Haitze J.; Paulusma, Daniël; Smit, Gerardus Johannes Maria; Vlaardingerbroek, F.; Woeginger, Gerhard.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - The Computational Complexity of the Minimum Weight Processor Assignment Problem

AU - Broersma, Haitze J.

AU - Paulusma, Daniël

AU - Smit, Gerardus Johannes Maria

AU - Vlaardingerbroek, F.

AU - Woeginger, Gerhard

PY - 2004/6

Y1 - 2004/6

N2 - In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors in an energy-efficient way. We model this problem as a graph optimization problem, which we call the minimum weight processor assignment problem. We show that our setting generalizes several problems known in literature, including minimum multiway cut, graph k-colorability, and minimum (generalized) vertex covering. We show that the minimum weight processor assignment problem is NP-hard, even when restricted to instances where the (process) graph is a bipartite graph with maximum degree at most 3, or with only two processors, or with arbitrarily small weight differences, or with only two different edge weights. For graphs with maximum degree at most 2 (or in fact the larger class of degree-2-contractible graphs) we give a polynomial time algorithm. Finally we generalize this algorithm into an exact (but not efficient) algorithm for general graphs.

AB - In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors in an energy-efficient way. We model this problem as a graph optimization problem, which we call the minimum weight processor assignment problem. We show that our setting generalizes several problems known in literature, including minimum multiway cut, graph k-colorability, and minimum (generalized) vertex covering. We show that the minimum weight processor assignment problem is NP-hard, even when restricted to instances where the (process) graph is a bipartite graph with maximum degree at most 3, or with only two processors, or with arbitrarily small weight differences, or with only two different edge weights. For graphs with maximum degree at most 2 (or in fact the larger class of degree-2-contractible graphs) we give a polynomial time algorithm. Finally we generalize this algorithm into an exact (but not efficient) algorithm for general graphs.

KW - CAES-EEA: Efficient Embedded Architectures

KW - EWI-1499

KW - IR-48397

KW - METIS-219813

U2 - 10.1007/978-3-540-30559-0_16

DO - 10.1007/978-3-540-30559-0_16

M3 - Conference contribution

SN - 3-540-24132-9

T3 - Lecture notes in computer science

SP - 189

EP - 200

BT - Graph-Theoretic Concepts in Computer Science

A2 - Hromkovic, Juraj

A2 - Nagl, Manfred

A2 - Westfechtel, Bernhard

PB - Springer

CY - Berlin

ER -