7006 search results - page 365 / 1402 » Approximation Algorithms |
136
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
132
click to vote
ISCAS
2005
IEEE
15 years 10 months ago
2005
IEEE
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
178
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
146
click to vote
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
147
click to vote
CPM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...