356 search results - page 28 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
RTCSA
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
MOC
2000
13 years 7 months ago
2000
The aim of this paper is to display numerical results that show the interest of some multilevel methods for problems of parabolic type. These schemes are based on multilevel spatia...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
CCE
2006
13 years 7 months ago
2006
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...