# Survivable Network Design with Degree or Order Constraints

**Type:** Papers  
**Canonical URL:** https://scholariq.org/papers/survivable-network-design-with-degree-or-order-constraints-2/

## Facts

| Field | Value |
| --- | --- |
| Author Names | Lap Chi Lau,Joseph Naor,Mohammad R. Salavatipour,Mohit Singh |
| Citations | 73 |
| DOI | 10.1137/070700620 |
| Fields | Computer Science |
| Open Access | false |
| OA Status | closed |
| OpenAlex ID | https://openalex.org/W2161190897 |
| Type | article |
| Year | 2009 |

## 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/)
- [Advanced Graph Theory Research](https://scholariq.org/topics/advanced-graph-theory-research/)
- [Optimization and Search Problems](https://scholariq.org/topics/optimization-and-search-problems/)

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