Skip to main content

Research Repository

Advanced Search

The Computational Complexity of the Minimum Weight Processor Assignment Problem

Broersma, H.J.; Paulusma, D.; Smit, G.J.M.; Vlaardingerbroek, F.; Woeginger, G.J.

Authors

H.J. Broersma

G.J.M. Smit

F. Vlaardingerbroek

G.J. Woeginger



Citation

Broersma, H., Paulusma, D., Smit, G., Vlaardingerbroek, F., & Woeginger, G. (2004, June). The Computational Complexity of the Minimum Weight Processor Assignment Problem. Presented at WG 2004: Graph-Theoretic Concepts in Computer Science, Bad Honnef, Germany

Presentation Conference Type Conference Paper (published)
Conference Name WG 2004: Graph-Theoretic Concepts in Computer Science
Start Date Jun 21, 2004
End Date Jun 23, 2004
Publication Date 2004
Deposit Date Dec 21, 2014
Print ISSN 0302-9743
Publisher Springer
Peer Reviewed Peer Reviewed
Volume 3353
Pages 189-200
Series ISSN 0302-9743,1611-3349
Book Title Graph-Theoretic Concepts in Computer Science
ISBN 978-3-540-24132-4
DOI https://doi.org/10.1007/978-3-540-30559-0_16
Public URL https://durham-repository.worktribe.com/output/1153034



You might also like



Downloadable Citations