Login / Signup

Dealing with large hidden constants: engineering a planar steiner tree PTAS.

Siamak TazariMatthias Müller-Hannemann
Published in: ACM J. Exp. Algorithmics (2011)
Keyphrases
  • steiner tree
  • minimum spanning tree
  • shortest path
  • facility location
  • approximation algorithms
  • approximation schemes
  • neural network
  • spanning tree
  • binary images
  • linear programming relaxation