1647 search results - page 30 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
ILP
2004
Springer
14 years 2 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
STOC
1998
ACM
14 years 1 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...