489 search results - page 24 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
162
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
122
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
154
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
127
Voted
FOCM
2011
14 years 10 months ago
2011
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
143
Voted
AAECC
2006
Springer
15 years 3 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...