On the public citation graph

Hardness of robust network design

0 signed · 82 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.20145openalex-snapshot
Provisioning virtual private networks under traffic uncertainty
inferredcites →https://doi.org/10.1006/jagm.1997.0866openalex-snapshot
Designing Least-Cost Nonblocking Broadband Networks
inferredcites →https://doi.org/10.1007/11496915_30openalex-snapshot
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
inferredcites →https://doi.org/10.1007/11523468_93openalex-snapshot
New Approaches for Virtual Private Network Design
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/s11081-005-1741-7openalex-snapshot
Routing of Uncertain Traffic Demands
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.010openalex-snapshot
Optimal oblivious routing in polynomial time
inferredcites →https://doi.org/10.1049/cp:20050360openalex-snapshot
Robust network design and selective randomized load balancing
inferredcites →https://doi.org/10.1109/ccc.2005.20openalex-snapshot
On the Hardness of Approximating Multicut and Sparsest-Cut
inferredcites →https://doi.org/10.1109/infocom.2006.91openalex-snapshot
Maximum Throughput Routing of Traffic in the Hose Model
inferredcites →https://doi.org/10.1145/2629614openalex-snapshot
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ 1
inferredcites →https://doi.org/10.1145/316188.316209openalex-snapshot
A flexible model for resource management in virtual private networks
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1145/380752.380830openalex-snapshot
Provisioning a virtual private network
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1145/777313.777314openalex-snapshot
Networks new economical virtual private
inferredcites →https://doi.org/10.1145/780542.780597openalex-snapshot
Simpler and better approximation algorithms for network design
inferredcites →https://doi.org/10.1145/863955.863991openalex-snapshot
Making intra-domain routing robust to changing and uncertain traffic demands

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20160openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1002/net.21482openalex-snapshot
Affine recourse for the robust network design problem: Between static and dynamic routing
inferred← citeshttps://doi.org/10.1002/net.21497openalex-snapshot
Robust network design: Formulations, valid inequalities, and computations
inferred← citeshttps://doi.org/10.1002/net.21621openalex-snapshot
The cut property under demand uncertainty
inferred← citeshttps://doi.org/10.1002/net.21807openalex-snapshot
Solving the bifurcated and nonbifurcated robust network loading problem with k‐adaptive routing
inferred← citeshttps://doi.org/10.1002/net.21888openalex-snapshot
A polyhedral analysis of the capacitated edge activation problem with uncertain demands
inferred← citeshttps://doi.org/10.1002/net.21997openalex-snapshot
Telecommunications network design: Technology impacts and future directions
inferred← citeshttps://doi.org/10.1002/net.22070openalex-snapshot
Affine routing for robust network design
inferred← citeshttps://doi.org/10.1002/wics.135openalex-snapshot
Computer network optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-04277-0_17openalex-snapshot
Network Planning for Stochastic Traffic Demands
inferred← citeshttps://doi.org/10.1007/978-3-319-51741-4_9openalex-snapshot
Vertex Sparsification in Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_25openalex-snapshot
Dynamic vs. Oblivious Routing in Network Design
inferred← citeshttps://doi.org/10.1007/978-3-642-21527-8_19openalex-snapshot
Affine Recourse for the Robust Network Design Problem: Between Static and Dynamic Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-25959-3_8openalex-snapshot
Competitive and Deterministic Embeddings of Virtual Networks
inferred← citeshttps://doi.org/10.1007/s00453-010-9455-4openalex-snapshot
Dynamic vs. Oblivious Routing in Network Design
inferred← citeshttps://doi.org/10.1007/s00500-023-08190-0openalex-snapshot
RETRACTED ARTICLE: Network learning path of university political education based on simulation data and sparse neural network
inferred← citeshttps://doi.org/10.1007/s10107-016-0991-9openalex-snapshot
Single-commodity robust network design with finite and Hose demand sets
inferred← citeshttps://doi.org/10.1007/s10255-017-0636-7openalex-snapshot
New discoveries of domination between traffic matrices
inferred← citeshttps://doi.org/10.1007/s10479-013-1371-yopenalex-snapshot
Robust delay-constrained routing in telecommunications
inferred← citeshttps://doi.org/10.1007/s10479-017-2751-5openalex-snapshot
Robust multiobjective optimization with application to Internet routing
inferred← citeshttps://doi.org/10.1007/s10589-012-9500-0openalex-snapshot
The robust network loading problem with dynamic routing
inferred← citeshttps://doi.org/10.1007/s10589-017-9956-zopenalex-snapshot
A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
inferred← citeshttps://doi.org/10.1007/s10898-010-9645-2openalex-snapshot
On 2-stage robust LP with RHS uncertainty: complexity results and applications
inferred← citeshttps://doi.org/10.1007/s10957-019-01528-5openalex-snapshot
A Distributed Method for Optimal Capacity Reservation
inferred← citeshttps://doi.org/10.1007/s11107-010-0294-7openalex-snapshot
Adaptive load-balancing in WDM mesh networks with performance guarantees
inferred← citeshttps://doi.org/10.1007/s11235-011-9602-5openalex-snapshot
Volume-oriented routing and its modifications
inferred← citeshttps://doi.org/10.1007/s11590-011-0341-zopenalex-snapshot
Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
inferred← citeshttps://doi.org/10.1007/s11590-013-0679-5openalex-snapshot
A comparison of routing sets for robust network design
inferred← citeshttps://doi.org/10.1007/s13675-017-0092-4openalex-snapshot
Multipolar robust optimization
inferred← citeshttps://doi.org/10.1016/j.comcom.2023.01.008openalex-snapshot
Routing and slot allocation in 5G hard slicing
inferred← citeshttps://doi.org/10.1016/j.cor.2011.02.019openalex-snapshot
Linear programming models for traffic engineering in 100% survivable networks under combined IS–IS/OSPF and MPLS-TE
inferred← citeshttps://doi.org/10.1016/j.cor.2017.06.011openalex-snapshot
A capacitated hub location problem under hose demand uncertainty
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.076openalex-snapshot
Multipolar routing: where dynamic and static routing meet
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.106openalex-snapshot
The cut condition for robust network design
inferred← citeshttps://doi.org/10.1016/j.orl.2009.01.009openalex-snapshot
On improving optimal oblivious routing
inferred← citeshttps://doi.org/10.1016/j.orl.2010.11.007openalex-snapshot
On total traffic domination in non-complete graphs
inferred← citeshttps://doi.org/10.1016/j.orl.2010.11.009openalex-snapshot
Static and dynamic routing under disjoint dominant extreme demands
inferred← citeshttps://doi.org/10.1016/j.orl.2013.04.011openalex-snapshot
Network design with a discrete set of traffic matrices
inferred← citeshttps://doi.org/10.1016/j.osn.2014.10.001openalex-snapshot
Multi-objective routing and wavelength converter allocation under uncertain traffic
inferred← citeshttps://doi.org/10.1016/j.osn.2018.11.004openalex-snapshot
An optimization model for robust FSO network dimensioning
inferred← citeshttps://doi.org/10.1016/j.scs.2014.01.002openalex-snapshot
Eco-burden in pavement maintenance: Effects from excess traffic growth and overload
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.036openalex-snapshot
Competitive and deterministic embeddings of virtual networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.01.026openalex-snapshot
On the approximability of robust network design
inferred← citeshttps://doi.org/10.1016/j.trc.2022.103593openalex-snapshot
Robust Liner Ship Routing and Scheduling Schemes under Uncertain Weather and Ocean Conditions
inferred← citeshttps://doi.org/10.1080/02331934.2026.2726391openalex-snapshot
A stochastic Lagrangian-based method for nonconvex optimization with nonlinear constraints
inferred← citeshttps://doi.org/10.1109/acssc.2008.5074828openalex-snapshot
On robust network coding subgraph construction under uncertainty
inferred← citeshttps://doi.org/10.1109/clei.2013.6670659openalex-snapshot
Robust network design under uncertain taffic an approach based on Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/clei.2015.7359980openalex-snapshot
MultiObjective robust network design under uncertain traffic an approach based on evolutionary algorithm
inferred← citeshttps://doi.org/10.1109/glocom.2009.5425958openalex-snapshot
More Adaptive Robust Stable Routing
inferred← citeshttps://doi.org/10.1109/netwks.2014.6959234openalex-snapshot
Network planning guaranteeing end-to-end overload probability for stochastic traffic demands
inferred← citeshttps://doi.org/10.1109/ngi.2010.5534462openalex-snapshot
Towards robust network design using integer linear programming techniques
inferred← citeshttps://doi.org/10.1109/rndm.2017.8093027openalex-snapshot
On robust FSO network dimensioning
inferred← citeshttps://doi.org/10.1109/tnet.2017.2782006openalex-snapshot
Kraken: Online and Elastic Resource Reservations for Cloud Datacenters
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2010.00764.xopenalex-snapshot
Robust routing and optimal partitioning of a traffic demand polytope
inferred← citeshttps://doi.org/10.1137/050626259openalex-snapshot
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
inferred← citeshttps://doi.org/10.1145/1324215.1324235openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1287/moor.1070.0280openalex-snapshot
Domination Between Traffic Matrices
inferred← citeshttps://doi.org/10.1287/opre.2013.1200openalex-snapshot
Robust and Adaptive Network Flows
inferred← citeshttps://doi.org/10.1364/jon.5.000320openalex-snapshot
Selective randomized load balancing and mesh networks with changing demands
inferred← citeshttps://doi.org/10.31428/10317/1762openalex-snapshot
Optimización y planificación de redes ópticas transparentes WDM
inferred← citeshttps://doi.org/10.70675/8dc681b0z83e8z459dz8f19z744e8fc791fcopenalex-snapshot
Robust dimensioning of wireless optical networks with multiple partial link failures
inferred← citeshttps://doi.org/10.70675/da3bdba6z3905z4a4czb0a6z751a1b0ae56dopenalex-snapshot
Robust optimization for network design
inferred← citeshttps://doi.org/10.70675/f186db86zfcc8z4f94zaed5z3e5ba7e74a03openalex-snapshot
Relaxations in mixed-integer quadratically constrained programming and robust programming
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.