An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph.

D. Ellis Hershkowitz Gregory Kehne R. Ravi

Published in: CoRR (2020)

Keyphrases

strongly connected
minimum cost
worst case
linear programming
np hard
dynamic programming
directed graph
approximation algorithms
bayesian networks
optimal solution
search space
undirected graph
mixed integer
minimum length
minimum error