Sciweavers

1469 search results - page 42 / 294
» Approximate polynomial decomposition
Sort
View
IPL
2000
146views more  IPL 2000»
14 years 9 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
MOC
2002
112views more  MOC 2002»
14 years 9 months ago
Approximation of the Hilbert Transform on the real line using Hermite zeros
The authors study the Hilbert Transform on the real line. They introduce some polynomial approximations and some algorithms for its numerical evaluation. Error estimates in uniform...
M. C. De Bonis, Biancamaria Della Vecchia, Giusepp...
WG
2007
Springer
15 years 3 months ago
Complexity and Approximation Results for the Connected Vertex Cover Problem
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
Bruno Escoffier, Laurent Gourvès, Jé...
CCCG
2007
14 years 11 months ago
Approximation Algorithms for the Minimum-Length Corridor and Related Problems
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
AAECC
1995
Springer
92views Algorithms» more  AAECC 1995»
15 years 1 months ago
Division of Entire Functions by Polynomial Ideals
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
Joachim Apel