64 search results - page 12 / 13 » A Polynomial Time Approximation Scheme for Minimum Routing C... |
FOCS
2007
IEEE
13 years 12 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
INFOCOM
2012
IEEE
11 years 8 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
AAAI
2008
13 years 7 months ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...