# 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-2/

## Facts

| Field | Value |
| --- | --- |
| Author Names | Mohit Singh,Lap Chi Lau |
| Citations | 158 |
| DOI | 10.1145/1250790.1250887 |
| Fields | Computer Science |
| Open Access | false |
| OA Status | closed |
| OpenAlex ID | https://openalex.org/W2157421865 |
| Type | conference-paper |
| Year | 2007 |

## 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/)
- [Machine Learning and Algorithms](https://scholariq.org/topics/machine-learning-and-algorithms/)
- [Advanced Graph Theory Research](https://scholariq.org/topics/advanced-graph-theory-research/)

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