Approximation Algorithms for Packing Directed Acyclic Graphs into Two-Size Blocks.
Yuichi AsahiroEiji MiyanoTsuyoshi YagitaPublished in: ICCSA (2) (2018)
Keyphrases
- approximation algorithms
- directed acyclic graph
- undirected graph
- constant factor
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- open shop
- equivalence classes
- np hardness
- approximation ratio
- structural learning
- set cover
- random variables
- approximation schemes
- equivalence class
- structural equation models
- markov equivalence classes
- randomized algorithms
- primal dual
- conditional independence
- directed graph
- precedence constraints
- causal models
- disjoint paths
- combinatorial auctions