3894 search results - page 148 / 779 » Approximation Algorithms for Biclustering Problems |
165
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
136
click to vote
AAIM
2008
Springer
16 years 24 days ago
2008
Springer
Facility Location can be seen as a whole family of problems which have many obvious applications in economics. They have been widely explored in the Operations Research community, ...
168
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
210
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
139
click to vote
DAGSTUHL
2007
15 years 8 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 ...