1424 search results - page 112 / 285 » The Multi-radius Cover Problem |
138
Voted
NETWORKS
2011
14 years 10 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
129
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
159
Voted
CPAIOR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
145
Voted
TCS
2010
15 years 1 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...
172
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...