791 search results - page 33 / 159 » Approximating the Maximum Sharing Problem |
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
In the mobile facility location problem, which is a variant of the classical Uncapacitated Facility Location and kMedian problems, each facility and client is assigned to a start ...
AUSDM
2008
Springer
13 years 9 months ago
2008
Springer
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
DATE
2010
IEEE
14 years 22 days ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
SWAT
1994
Springer
13 years 11 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
DAGSTUHL
2007
13 years 9 months 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 ...