Return to search

Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph

No description available.
Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:AEU.uuid#999f92a0-d508-484e-b39e-6b17cdc3cdcd
CreatorsKhani, Mohammad Reza
PublisherUniversity of Alberta
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
Languageen_US
Detected LanguageEnglish
TypeThesis
Formatapplication/pdf

Page generated in 0.0021 seconds