237 search results - page 3 / 48 » Approximation Algorithms for Minimum Tree Partition |
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
APPROX
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
INFOCOM
2012
IEEE
11 years 8 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
STOC
2000
ACM
13 years 10 months ago
2000
ACM
STOC
1994
ACM
13 years 10 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...