3875 search results - page 33 / 775 » Approximation Algorithms for the Max-coloring Problem |
CIAC
2006
Springer
13 years 11 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
JDA
2007
13 years 7 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
DAGSTUHL
2007
13 years 9 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...