7150 search results - page 350 / 1430 » An Approximation Algorithm for Approximation Rank |
201
click to vote
WAOA
2005
Springer
16 years 7 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
164
Voted
APPROX
2004
Springer
16 years 4 days ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
186
click to vote
JCO
2011
15 years 1 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
212
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
166
Voted
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...