Sciweavers

12519 search results - page 46 / 2504
» Approximation Problems Categories
Sort
View
ECCC
2007
86views more  ECCC 2007»
15 years 2 months ago
On Parameterized Approximability
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
Yijia Chen, Martin Grohe, Magdalena Grüber
IPL
2011
112views more  IPL 2011»
14 years 9 months ago
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
Hiroki Morizumi
221
Voted
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
15 years 8 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger
158
Voted
IPCO
2008
129views Optimization» more  IPCO 2008»
15 years 4 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
LATIN
2000
Springer
15 years 6 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...