1405 search results - page 21 / 281 » Popularity at Minimum Cost |
DAGSTUHL
2007
13 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 ...
SODA
2004
ACM
13 years 8 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
DAM
2010
13 years 7 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...