432 search results - page 22 / 87 » Open Problems with Part-Whole Relations |
123
Voted
TCS
2010
14 years 10 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
118
Voted
SODA
2010
ACM
15 years 9 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...
115
click to vote
COCO
2004
Springer
15 years 4 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
82
Voted
IM
2003
15 years 1 months ago
2003
: Desktop management is probably the most resource-consuming task for the typical operations and support team, regardless of being frequently overlooked as not as complex or specia...
125
click to vote
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...