137 search results - page 19 / 28 » Parameterized approximation of dominating set problems |
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
SIAMSC
2010
13 years 6 months ago
2010
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
TCS
2010
13 years 6 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...