13987 search results - page 134 / 2798 » The Two Guards Problem |
146
Voted
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
159
Voted
EOR
2010
15 years 25 days ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
136
Voted
JSCIC
2010
14 years 10 months ago
2010
This paper considers highly ill-posed surface recovery inverse problems, where the sought surface in 2D or 3D is piecewise constant with several possible level values. These level...
126
Voted
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
131
click to vote
AIMSA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...