791 search results - page 18 / 159 » Approximating the Maximum Sharing Problem |
133
Voted
AAIM
2006
Springer
15 years 8 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
109
click to vote
IPL
2006
15 years 2 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
132
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
167
Voted
IFIPTCS
2010
15 years 21 days ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
138
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...