Mehlhorn Kurt

Kurt Mehlhorn

Information about the author Kurt Mehlhorn will soon be added to the site.
Found 5 papers in total
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
2014
We reconsider the well‐studied Selfish Routing game with affine latency...
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
2012
A graph is triconnected if it is connected, has at least 4 vertices and the removal of...
New Approximation Algorithms for Minimum Cycle Bases of Graphs
New Approximation Algorithms for Minimum Cycle Bases of Graphs
2011
We consider the problem of computing an approximate minimum cycle basis of an...
Assigning papers to referees
Assigning papers to referees
2010
Refereed conferences require every submission to be reviewed by members of a program...
Faster algorithms for the shortest path problem
Faster algorithms for the shortest path problem
1990
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A...
Papers per page: