Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

114

WADS
2007
Springer

120views Algorithms» more WADS 2007»

Branch and Recharge: Exact Algorithms for Generalized Domination

15 years 9 months ago

Branch and Recharge: Exact Algorithms for Generalized Domination

Download lita.sciences.univ-metz.fr

Fedor V. Fomin, Petr A. Golovach, Jan Kratochv&iac

Real-time Traffic

Algorithms | WADS 2007 |

claim paper

Related Content

» InclusionExclusion Branching for Partial Dominating Set and Set Splitting

» Design by Measure and Conquer A Faster Exact Algorithm for Dominating Set

» An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

» Linear Time Algorithms for Generalized Edge Dominating Set Problems

» Exact solutions to a class of stochastic generalized assignment problems

» Exact and Parameterized Algorithms for Max Internal Spanning Tree

» A Branch and Bound Algorithm for Numerical MAXCSP

» A generalized method of moments for closed queueing networks

» Using Genetic Algorithms to Simulate the Evolution of an Oligopoly Game

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WADS
Authors	Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff

Comments (0)