7150 search results - page 91 / 1430 » An Approximation Algorithm for Approximation Rank |
125
click to vote
WAOA
2010
Springer
14 years 10 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
74
Voted
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
COMGEO
2010
ACM
15 years 22 days ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
104
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...
118
Voted
SIAMCOMP
2008
15 years 16 days ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...