186 search results - page 16 / 38 » Improved approximation algorithms for directed Steiner fores... |
SODA
2010
ACM
15 years 7 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...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
ICANN
2007
Springer
15 years 3 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
RNA molecules whose secondary structures contain similar substructures often have similar functions. Therefore, an important task in the study of RNA is to develop methods for disc...
CGF
2008
14 years 9 months ago
2008
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...