4843 search results - page 135 / 969 » The Shortcut Problem - Complexity and Approximation |
94
Voted
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
91
Voted
FSTTCS
2007
Springer
15 years 4 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
75
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
95
Voted
AI
2006
Springer
15 years 2 months ago
2006
Springer
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
70
Voted
UAI
2001
14 years 11 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...