Approximating a capacitated 2-edge-connected spanning subgraph problem.
Journal Article
·
· Operations Research Letters
OSTI ID:1106938
Abstract not provided.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1106938
- Report Number(s):
- SAND2011-6628J; 464602
- Journal Information:
- Operations Research Letters, Related Information: Proposed for publication in Operations Research Letters.
- Country of Publication:
- United States
- Language:
- English
Similar Records
A 2-edge-connected spanning subgraph problem.
A 2-edge-connected spanning subgraph problem.
Approximating a 2-edge-connected subgraph problem.
Conference
·
Sun Feb 01 00:00:00 EST 2015
·
OSTI ID:1106938
A 2-edge-connected spanning subgraph problem.
Conference
·
Sat Oct 01 00:00:00 EDT 2011
·
OSTI ID:1106938
Approximating a 2-edge-connected subgraph problem.
Conference
·
Mon Aug 01 00:00:00 EDT 2011
·
OSTI ID:1106938