Sciweavers

4843 search results - page 117 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
91
Voted
ICALP
2001
Springer
15 years 2 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
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...
Gerhard J. Woeginger
IEICET
2010
124views more  IEICET 2010»
14 years 7 months ago
A Deterministic Approximation Algorithm for Maximum 2-Path Packing
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...
Ruka Tanahashi, Zhi-Zhong Chen
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
15 years 4 months ago
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
SWAT
2010
Springer
269views Algorithms» more  SWAT 2010»
15 years 3 months ago
Approximation Algorithms for Free-Label Maximization
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...
Mark de Berg, Dirk H. P. Gerrits
CORR
2010
Springer
104views Education» more  CORR 2010»
14 years 10 months ago
Approximating the minimum directed tree cover
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...
Viet Hung Nguyen