416 search results - page 37 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
131
click to vote
INFORMATICALT
2002
15 years 2 months ago
2002
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
140
click to vote
CATS
2006
15 years 4 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
123
click to vote
ML
2002
ACM
15 years 2 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
134
click to vote
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
114
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...