631 search results - page 6 / 127 » Additive Approximation for Edge-Deletion Problems |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
TACAS
2010
Springer
14 years 25 days ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
ENTCS
2006
13 years 7 months ago
2006
This paper extends the domain theoretic method for solving initial value problems, described in [8], to unbounded vector fields. Based on a sequence of approximations of the vecto...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...