1054 search results - page 35 / 211 » Capacitated Domination Problem |
DAM
2006
15 years 2 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
128
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
151
Voted
FSTTCS
2010
Springer
15 years 14 days ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
106
click to vote
ACL
2010
15 years 15 days ago
2010
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...