7129 search results - page 373 / 1426 » Approximation Algorithms for Treewidth |
129
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
153
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
139
click to vote
APPROX
2004
Springer
15 years 10 months 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...
143
click to vote
JCO
2011
14 years 11 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...
164
click to vote
SODA
2012
ACM
13 years 7 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...