3415 search results - page 95 / 683 » Lower Bounds for Kernelizations |
JC
2006
15 years 4 months ago
2006
128
click to vote
EOR
2007
15 years 4 months ago
2007
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
156
click to vote
NETWORKS
2006
15 years 4 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...