3874 search results - page 61 / 775 » Approximation Algorithms for k-hurdle Problems |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
CSC
2009
14 years 11 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...