Login / Signup

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs.

Marcin PilipczukMichal PilipczukPiotr SankowskiErik Jan van Leeuwen
Published in: ACM Trans. Algorithms (2018)
Keyphrases
  • planar graphs
  • computer networks
  • communication networks
  • finding the shortest path
  • reinforcement learning
  • wireless sensor networks
  • least squares
  • graph theory
  • network design
  • real world networks