Sciweavers

3475 search results - page 57 / 695
» Backbones in Optimization and Approximation
Sort
View
JAT
2008
57views more  JAT 2008»
13 years 10 months ago
Sharp approximations to the Bernoulli periodic functions by trigonometric polynomials
We obtain optimal trigonometric polynomials of a given degree N that majorize, minorize and approximate in L1(R/Z) the Bernoulli periodic functions. These are the periodic analogue...
Emanuel Carneiro
COLOGNETWENTE
2010
13 years 8 months ago
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Bodo Manthey, Kai Plociennik
MOC
2010
13 years 4 months ago
Discontinuous Galerkin approximations of the Stokes and Navier-Stokes equations
Numerical schemes to compute approximate solutions of the evolutionary Stokes and Navier-Stokes equations are studied. The schemes are discontinuous in time and conforming in space...
Konstantinos Chrysafinos, Noel Walkington
MST
2007
167views more  MST 2007»
13 years 9 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 4 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...