Sciweavers

12519 search results - page 82 / 2504
» Approximation Problems Categories
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 5 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
CCCG
2010
15 years 7 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
STOC
2005
ACM
111views Algorithms» more  STOC 2005»
16 years 6 months ago
Tensor decomposition and approximation schemes for constraint satisfaction problems
Wenceslas Fernandez de la Vega, Marek Karpinski, R...
IFIP
2005
Springer
15 years 11 months ago
Numerical Approximation of a Control Problem for Advection-Diffusion Processes
Two different approaches are proposed to enhance the efficiency of the numerical resolution of optimal control problems governed by a linear advection– diffusion equation. In ...
Alfio Quarteroni, Gianluigi Rozza, L. Dedè,...