4843 search results - page 117 / 969 » The Shortcut Problem - Complexity and Approximation |
173
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
177
click to vote
IEICET
2010
15 years 3 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
176
click to vote
CDC
2008
IEEE
16 years 24 days ago
2008
IEEE
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
190
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...