5595 search results - page 370 / 1119 » Approximation Algorithms for Clustering Problems |
179
click to vote
EMO
2003
Springer
15 years 12 months ago
2003
Springer
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
151
click to vote
ENDM
2008
15 years 6 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
180
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper studies the infinite-horizon sensor scheduling problem for linear Gaussian processes with linear measurement functions. Several important properties of the optimal infin...
187
Voted
MP
2007
15 years 6 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
175
click to vote
FCT
2005
Springer
16 years 9 days ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...