5 search results - page 1 / 1 » Combinatorial bounds via measure and conquer: Bounding minim... |
TALG
2008
13 years 4 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
CORR
2008
Springer
13 years 4 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...
JCSS
2008
13 years 4 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Given a wireless network where each link undergoes small-scale (Rayleigh) fading, we consider the problem of routing a message from a source node to a target node while minimizing...