# Survivable network design with degree or order constraints

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

## Facts

| Field | Value |
| --- | --- |
| Author Names | Lap Chi Lau,Joseph Naor,Mohammad R. Salavatipour,Mohit Singh |
| Citations | 67 |
| DOI | 10.1145/1250790.1250886 |
| Fields | Computer Science |
| Open Access | false |
| OA Status | closed |
| OpenAlex ID | https://openalex.org/W2055155874 |
| 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/)
- [Distributed systems and fault tolerance](https://scholariq.org/topics/distributed-systems-and-fault-tolerance/)
- [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.