Dynamic programming meets the principle of inclusion and exclusion

Authors:
Richard M. Karp
Affiliations:
Computer Science Division, University of California, Berkeley, CA 94720, U.S.A.
Venue:
Operations Research Letters
Year:
1982

Citing 1
Cited 10

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Open problems around exact algorithms

Discrete Applied Mathematics
Finding paths of length k in O∗(2k) time

Information Processing Letters
Set multi-covering via inclusion-exclusion

Theoretical Computer Science
An exact algorithm for subgraph homeomorphism

Journal of Discrete Algorithms
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

Journal of Combinatorial Theory Series B
On partitioning a graph into two connected subgraphs

Theoretical Computer Science
Exact algorithms for the Hamiltonian cycle problem in planar graphs

Operations Research Letters
Counting minimum weighted dominating sets

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Near-optimal continuous patrolling with teams of mobile information gathering agents

Artificial Intelligence
Fast hamiltonicity checking via bases of perfect matchings

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that several combinatorial existence problems can be attacked by solving associated enumeration problems using a combination of dynamic programming and the principle of inclusion and exclusion. In comparison with the usual dynamic programming algorithms, the new methods have somewhat greater execution time but require far less storage.