Login / Signup

-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.

Jana CslovjecsekMichal PilipczukKarol Wegrzycki
Published in: SODA (2024)
Keyphrases
  • worst case
  • computational complexity
  • optimal solution
  • planar graphs
  • probabilistic model
  • combinatorial optimization
  • graph structure