Knemann Jochen

Jochen Knemann

Information about the author Jochen Knemann will soon be added to the site.
Found 6 papers in total
The School Bus Problem on Trees
The School Bus Problem on Trees
2013
The School Bus Problem is an NP‐hard vehicle routing problem in which the goal...
A Unified Approach to Approximating Partial Covering Problems
A Unified Approach to Approximating Partial Covering Problems
2011
An instance of the generalized partial cover problem consists of a ground set U and a...
Improved approximations for tour and tree covers
Improved approximations for tour and tree covers
2003
A tree (tour) cover of an edge-weighted graph is a set of edges which forms a tree...
Approximating k-hop minimum-spanning trees
Approximating k-hop minimum-spanning trees
2005
Given a complete graph on ∼ n nodes with metric edge costs, the minimum-cost k...
Min–max tree covers of graphs
Min–max tree covers of graphs
2004
We provide constant factor approximation algorithms for covering the nodes of a graph...
An approximation algorithm for the edge-dilation k-center problem
An approximation algorithm for the edge-dilation k-center problem
2004
We provide an approximation algorithm for selecting centers in a complete graph so as...
Papers per page: