Skip to main navigation
Skip to search
Skip to main content
Home
Profiles
Research Units
Research output
Datasets
Activities
Prizes
Press / Media
Search by expertise, name or affiliation
The computational complexity of the minimum weight processor assignment problem
Daniël Paulusma (Speaker)
Discrete Mathematics and Mathematical Programming
Activity
:
Talk or presentation
›
Oral presentation
Description
Plaats van uitgifte: Bad Honnef, Germany
Period
21 Jun 2004
Event title
30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004
Event type
Workshop
Conference number
30
Location
Bad Honnef, Germany
Keywords
METIS-219399