Login / Signup

Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.

André BergerArtur CzumajMichelangelo GrigniHairong Zhao
Published in: ESA (2005)
Keyphrases
  • approximation schemes
  • planar graphs
  • approximation algorithms
  • weighted graph
  • minimum cost
  • undirected graph
  • numerical methods
  • data structure
  • bin packing
  • np hard
  • social networks
  • shortest path
  • connected components