Diego de Uña

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Steiner Tree Problem is a well know NP-complete problem that is well studied and for which fast algorithms are already available. Nonetheless, in the real world the Steiner Tree Problem is almost always accompanied by side constraints which means these approaches cannot be applied. For many problems with side constraints, only approximation algorithms(More)
  • 1