Computer Science – Discrete Mathematics
Scientist
Computer Science
Discrete Mathematics
Scientist
Efficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances
Hypergraphic LP Relaxations for Steiner Trees
Integrality Gap of the Hypergraphic Relaxation of Steiner Trees: a short proof of a 1.55 upper bound
On Column-restricted and Priority Covering Integer Programs
No associations
LandOfFree
Jochen Koenemann does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Jochen Koenemann, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Jochen Koenemann will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-57303