On the public citation graph
New Approaches for Virtual Private Network Design
0 signed · 34 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.10064openalex-snapshot
Reserving resilient capacity for a single commodity with upper‐bound constraints
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/bf00288961openalex-snapshot
A fast algorithm for Steiner trees
inferredcites →https://doi.org/10.1109/infcom.2002.1019254openalex-snapshot
Restoration algorithms for virtual private networks in the hose model
inferredcites →https://doi.org/10.1109/ms.1985.231038openalex-snapshot
25th Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1109/sfcs.1975.21openalex-snapshot
On the complexity of time table and multi-commodity flow problems
inferredcites →https://doi.org/10.1109/sfcs.1998.743427openalex-snapshot
The access network design problem
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1137/s0895480100368189openalex-snapshot
Reserving Resilient Capacity in a Network
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/380752.380830openalex-snapshot
Provisioning a virtual private network
inferredcites →https://doi.org/10.1145/780542.780597openalex-snapshot
Simpler and better approximation algorithms for network design
inferredcites →https://doi.org/10.5555/1070432.1070566openalex-snapshot
An improved approximation algorithm for virtual private network design
inferredcites →https://doi.org/10.5555/338219.338638openalex-snapshot
Improved Steiner tree approximation in graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11758471_13openalex-snapshot
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-99626-4_25openalex-snapshot
Evolutionary Algorithms for Design of Virtual Private Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_32openalex-snapshot
Infrastructure Leasing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_69openalex-snapshot
Deterministic Sampling Algorithms for Network Design
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_42openalex-snapshot
Network Design via Core Detouring for Problems without a Core
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_20openalex-snapshot
Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
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.1016/j.jcss.2010.02.001openalex-snapshot
Connected facility location via random facility sampling and core detouring
inferred← citeshttps://doi.org/10.1016/j.orl.2005.09.005openalex-snapshot
Design of trees in the hose model: The balanced case
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.036openalex-snapshot
Competitive and deterministic embeddings of virtual networks
inferred← citeshttps://doi.org/10.1109/cse.2015.23openalex-snapshot
The Genetic Approach for Design of Virtual Private Networks
inferred← citeshttps://doi.org/10.1109/drcn.2007.4762277openalex-snapshot
Between fully dynamic routing and robust stable routing
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/1236457.1236458openalex-snapshot
Approximation via cost sharing
inferred← citeshttps://doi.org/10.1287/moor.1070.0280openalex-snapshot
Domination Between Traffic Matrices
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.