Sciweavers

150
Voted
COLOGNETWENTE
2007
15 years 5 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg
77
Voted
COLOGNETWENTE
2007
15 years 5 months ago
Edge cover by bipartite subgraphs
Marie-Christine Plateau, Leo Liberti, Laurent Alfa...
84
Voted
COLOGNETWENTE
2007
15 years 5 months ago
On revenue equivalence in truthful mechanisms
Birgit Heydenreich, Rudolf Müller, Marc Uetz,...
Optimization
Top of PageReset Settings