Login / Signup

Algorithms for 2-connected network design and flexible Steiner trees with a constant number of terminals.

Ishan BansalJoe CheriyanLogan GroutSharat Ibrahimpur
Published in: CoRR (2022)
Keyphrases
  • network design
  • computational complexity
  • graph theory
  • steiner tree
  • worst case
  • combinatorial optimization
  • minimum spanning tree