Login / Signup

Approximating (p, 2) flexible graph connectivity via the primal-dual method.

Ishan BansalJoseph CheriyanLogan GroutSharat Ibrahimpur
Published in: CoRR (2022)
Keyphrases
  • dynamic programming
  • computational complexity
  • primal dual
  • objective function
  • evolutionary algorithm
  • probabilistic model
  • semidefinite programming