630 search results - page 30 / 126 » Hardness results for approximating the bandwidth |
178
click to vote
CALC
2001
Springer
15 years 10 months ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
312
click to vote
IACR
2011
14 years 5 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
141
click to vote
COCOON
2005
Springer
15 years 11 months 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...
180
click to vote
APPROX
2009
Springer
16 years 21 days ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
153
click to vote
SIAMCOMP
2000
15 years 5 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...