Sciweavers

1933 search results - page 58 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
14 years 3 days ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
EOR
2008
90views more  EOR 2008»
13 years 8 months ago
An improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
FSTTCS
2007
Springer
14 years 2 months ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
14 years 2 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,...
ACII
2005
Springer
14 years 2 months ago
Pronunciation Learning and Foreign Accent Reduction by an Audiovisual Feedback System
Abstract. Global integration and migration force people to learn additional languages. With respect to major languages, the acquisition is already initiated at primary school but a...
Oliver Jokisch, Uwe Koloska, Diane Hirschfeld, R&u...