14518 search results - page 260 / 2904 » Two Problems for Sophistication |
128
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
118
Voted
INFOSCALE
2007
ACM
15 years 2 months ago
2007
ACM
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
105
Voted
EUROCAST
2005
Springer
15 years 6 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
105
Voted
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
105
Voted
BMCBI
2010
15 years 1 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...