2194 search results - page 45 / 439 » Improving HLRTA*( k ) |
DAGSTUHL
2007
14 years 13 days ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
SIAMDM
2000
13 years 10 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
DATE
2005
IEEE
14 years 4 months ago
2005
IEEE