Inclusion/exclusion meets measure and conquer
From MaRDI portal
Publication:2249747
Recommendations
- scientific article; zbMATH DE number 7273857
- Inclusion-exclusion redux
- Inclusion-exclusion: exact and approximate
- Approximate inclusion-exclusion
- Inclusion-exclusion inequalities
- On approximate inclusion-exclusion
- Inclusion/Exclusion Meets Measure and Conquer
- Measure differential inclusions -- between continuous and discrete
- scientific article; zbMATH DE number 1788302
- On rational cardinality-based inclusion measures
Cites work
- A bound on the pathwidth of sparse graphs with applications to exact algorithms
- A branch-and-reduce algorithm for finding a minimum independent dominating set
- A faster algorithm for dominating set analyzed by the potential method
- A measure \& conquer approach for the analysis of exact algorithms
- A note on the complexity of minimum dominating set
- A partial k-arboretum of graphs with bounded treewidth
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
- Algorithms for dominating clique problems
- An exact algorithm for the maximum leaf spanning tree problem
- An improved exact algorithm for the domatic number problem
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat}
- Combinatorial bounds via measure and conquer
- Counting Paths and Packings in Halves
- Counting subgraphs via homomorphisms
- Covering and packing in linear space
- Dynamic programming meets the principle of inclusion and exclusion
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- Efficiency in exponential time for domination-type problems
- Enumerate and measure: improving parameter budget management
- Even faster algorithm for set splitting!
- Exact algorithms for dominating set
- Exact algorithms for edge domination
- Exact algorithms for exact satisfiability and number of perfect matchings
- Exact covers via determinants
- Exact exponential algorithms.
- Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes
- Fast algorithms for \textsc{min independent dominating set}
- Fast algorithms for max independent set
- Fourier meets M\"{o}bius: fast subset convolution
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3188524 (Why is no real title available?)
- Implicit branching and parameterized partial cover problems
- Improved approximations for max set splitting and max NAE SAT
- Improved bounds and algorithms for hypergraph 2-coloring
- Improved parameterized set splitting algorithms: A Probabilistic approach
- Inclusion and exclusion algorithm for the Hamiltonian path problem
- Inclusion/Exclusion Meets Measure and Conquer
- Limits and Applications of Group Algebras for Parameterized Problems
- Mathematical Foundations of Computer Science 2005
- Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\)
- On a combinatorial problem. II
- On independent sets and bicliques in graphs
- On partitioning a graph into two connected subgraphs
- On problems as hard as CNF-SAT
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- On two techniques of combining branching and treewidth
- Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
- Parameterized and Exact Computation
- Partial vs. Complete Domination: t-Dominating Set
- Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
- Set partitioning via inclusion-exclusion
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- SOFSEM 2006: Theory and Practice of Computer Science
- Solving connected dominating set faster than \(2^n\)
- Subexponential algorithms for partial cover problems
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Trimmed Moebius inversion and graphs of bounded degree
Cited in
(13)- Exact algorithms for counting 3-colorings of graphs
- Roman domination in subgraphs of grids
- Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
- A measure \& conquer approach for the analysis of exact algorithms
- Set partitioning via inclusion-exclusion
- Polynomial space algorithms for counting dominating sets and the domatic number
- Inclusion/Exclusion Meets Measure and Conquer
- Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
- Exact Algorithms for the Minimum Load Spanning Tree Problem
- Automata, Languages and Programming
- NP-completeness results for partitioning a graph into total dominating sets
- Enumerating minimal connected dominating sets
- Enumerating minimal connected dominating sets
This page was built for publication: Inclusion/exclusion meets measure and conquer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249747)
