356 search results - page 1 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
91
Voted
ACTA
2004
15 years 1 months ago
2004
128
click to vote
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
112
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
104
click to vote
ORL
1998
15 years 1 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
131
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...