1941 search results - page 62 / 389 » On the Hardness of Approximate Reasoning |
187
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
179
click to vote
CATS
2006
15 years 7 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
249
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
177
click to vote
SARA
2009
Springer
16 years 25 days ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...