982 search results - page 36 / 197 » Solving Steiner tree problems in graphs to optimality |
167
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
155
click to vote
ECAI
2004
Springer
15 years 9 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
149
click to vote
HEURISTICS
2006
15 years 4 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
146
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
140
click to vote
SAC
2004
ACM
15 years 9 months ago
2004
ACM
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...