# Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal

**Type:** Papers  
**Canonical URL:** https://scholariq.org/papers/approximating-minimum-bounded-degree-spanning-trees-to-within-one-of-optimal/

## Facts

| Field | Value |
| --- | --- |
| Author Names | Mohit Singh,Lap Chi Lau |
| Citations | 63 |
| DOI | 10.1145/2629366 |
| Fields | Computer Science |
| Open Access | false |
| OA Status | closed |
| OpenAlex ID | https://openalex.org/W2004163233 |
| Type | article |
| Year | 2015 |

## Paper authors

- [Mohit Singh](https://scholariq.org/researchers/mohit-singh/)

## Paper primary topic

- [Complexity and Algorithms in Graphs](https://scholariq.org/topics/complexity-and-algorithms-in-graphs/)

## Paper topics

- [Complexity and Algorithms in Graphs](https://scholariq.org/topics/complexity-and-algorithms-in-graphs/)
- [Optimization and Search Problems](https://scholariq.org/topics/optimization-and-search-problems/)
- [Computational Geometry and Mesh Generation](https://scholariq.org/topics/computational-geometry-and-mesh-generation/)

---
Source: ScholarIQ — public research metadata, principally OpenAlex. See https://scholariq.org/sources/ for provenance and https://scholariq.org/methodology/ for what these figures mean.