356 search results - page 30 / 72 » Approximation schemes for the Min-Max Starting Time Problem |
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
ADHOCNOW
2009
Springer
13 years 8 months ago
2009
Springer
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
ICCV
2005
IEEE
14 years 9 months ago
2005
IEEE
Although variational methods are among the most accurate techniques for estimating the optical flow, they have not yet entered the field of real-time vision. Main reason is the gr...
CN
2006
13 years 7 months ago
2006
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...