1469 search results - page 92 / 294 » Approximate polynomial decomposition |
VISUALIZATION
1997
IEEE
15 years 2 months ago
1997
IEEE
We present an algorithm for the visualization of vector field topology based on Clifford algebra. It is the first method allowing the detection of higher order singularities. Th...
155
click to vote
SIAMCOMP
2011
14 years 21 days ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
AAAI
2012
13 years 8 days ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
DAM
2010
14 years 10 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...