Login / Signup
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation.
Louis Dublois
Michael Lampis
Vangelis Th. Paschos
Published in:
Theor. Comput. Sci. (2022)
Keyphrases
</>
worst case
computationally expensive
learning algorithm
dominating set
computational complexity
computational cost
optimization problems
theoretical analysis
scheduling problem
computer networks
generalization error bounds