Sciweavers

1502 search results - page 19 / 301
» Node weighted scheduling
Sort
View
ALGORITHMICA
2005
149views more  ALGORITHMICA 2005»
13 years 9 months ago
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
Markus Bläser, Bodo Manthey
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 4 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders