Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems

Award ID(s):: 1910149

NSF-PAR ID:: 10293564

Author(s) / Creator(s):: Chekuri, Chandra; Quanrud, Kent; Torres, Manuel

Date Published:: 2021-07-01

Journal Name:: Proceedings of APPROX 2021

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
The DOI is not currently available.