A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs.
Andrew Bloch-HansenDaniel R. PageRoberto Solis-ObaPublished in: IWOCA (2023)
Keyphrases
- polynomial time approximation
- directed acyclic graph
- approximation algorithms
- error bounds
- np hard
- structural learning
- equivalence class
- undirected graph
- directed graph
- equivalence classes
- random variables
- conditional independence
- identical machines
- bin packing
- causal discovery
- causal reasoning
- bayesian network structure
- approximation guarantees
- causal models
- scheduling problem
- bayesian networks
- markov chain
- independence relations