Login / Signup
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph.
D. Ellis Hershkowitz
Gregory Kehne
R. Ravi
Published in:
Inf. Process. Lett. (2021)
Keyphrases
</>
strongly connected
minimum cost
approximation algorithms
dynamic programming
optimal solution
worst case
maximum weight
np hard
linear programming
search space
scheduling problem
markov chain
directed graph
optimum path forest