z-logo
open-access-imgOpen Access
Approximability of Robust Network Design
Author(s) -
Neil Olver,
F. Bruce Shepherd
Publication year - 2010
Language(s) - Uncategorized
Resource type - Conference proceedings
DOI - 10.1137/1.9781611973075.89
Subject(s) - polytope , steiner tree problem , network planning and design , approximation algorithm , computer science , reduction (mathematics) , generalization , convex polytope , mathematical optimization , combinatorics , regular polygon , tree (set theory) , constant (computer programming) , mathematics , set (abstract data type) , discrete mathematics , convex optimization , convex set , computer network , mathematical analysis , geometry , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom