Inclusion/Exclusion Meets Measure and Conquer

Inclusion/exclusion and measure and conquer are two central techniques from the field of exact exponential-time algorithms that recently received a lot of attention. In this paper, we show that both techniques can be used in a single algorithm. This is done by looking at the principle of inclusion/e...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 69; číslo 3; s. 685 - 740
Hlavní autoři:	Nederlof, Jesper, van Rooij, Johan M. M., van Dijk, Thomas C.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Boston Springer US 01.07.2014 Springer
Témata:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Theoretical computing Theory of Computation Branching Exact exponential algorithm NP-hard Dominating set Inclusion/Exclusion Expert system Algorithmics Graph theory Computational complexity Polynomial time Upper bound System reduction Domination number NP hard problem Exponential time Time complexity Satisfiability
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!