4894 search results - page 228 / 979 » The Guarding Problem - Complexity and Approximation |
266
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
170
click to vote
FCT
2005
Springer
16 years 2 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. ...
234
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
149
click to vote
COCOON
2005
Springer
16 years 2 days ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...