168 search results - page 8 / 34 » On Nontrivial Approximation of CSPs |
IPL
2002
13 years 10 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
WADS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
APPROX
2008
Springer
14 years 11 days ago
2008
Springer
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
JNS
2007
13 years 10 months ago
2007
We study the slow singular limit for planar anharmonic oscillatory motion of a charged particle under the influence of a perpendicular magnetic field when the mass of the particl...
LICS
2012
IEEE
12 years 23 days ago
2012
IEEE
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...