Skip to main navigation
Skip to search
Skip to main content
University of Twente Research Information Home
Home
Profiles
Research units
Projects
Research output
Datasets
Activities
Prizes
Press/Media
Search by expertise, name or affiliation
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size
P.C. Pop (Speaker)
Discrete Mathematics and Mathematical Programming
Activity
:
Talk or presentation
›
Oral presentation
Period
25 Oct 2001
Event title
EIDMA 2001 Symposium
Event type
Conference
Location
Oostende, Belgium
Show on map
X