153 search results - page 8 / 31 » Computing Approximate Solutions of the Maximum Covering Prob... |
IRREGULAR
1995
Springer
13 years 11 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
ICALP
2004
Springer
14 years 28 days ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
DAM
2011
13 years 2 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
ESA
2001
Springer
14 years 1 days ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...