344 search results - page 8 / 69 » The Directed Minimum Latency Problem |
SODA
2003
ACM
15 years 2 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of ...
111
Voted
DATE
2006
IEEE
15 years 4 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
90
Voted
JCO
2010
14 years 11 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
127
Voted
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
116
click to vote
NETCOOP
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we study a pursuit problem in the context of a wireless sensor network, where the pursuer (i.e., mobile sink) trying to capture a pursuee (i.e., tracked object), movi...