On the public citation graph
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
0 signed · 22 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.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/3-540-52292-1_14openalex-snapshot
Beyond Steiner's problem: A VLSI oriented generalization
inferredcites →https://doi.org/10.1007/3-540-55121-2_8openalex-snapshot
The complexity of approximating the class Steiner tree problem
inferredcites →https://doi.org/10.1016/j.endm.2004.03.007openalex-snapshot
Virtual Private Network Design Under Traffic Uncertainty
inferredcites →https://doi.org/10.1109/infcom.2004.1354650openalex-snapshot
Optimal bandwidth reservation in hose-model VPNs with multi-path routing
inferredcites →https://doi.org/10.1145/237814.237977openalex-snapshot
A threshold of ln n for approximating set cover (preliminary version)
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.1016/j.comnet.2013.06.009openalex-snapshot
Hose workload based exact algorithm for the optimal design of virtual private networks
inferred← citeshttps://doi.org/10.1016/j.orl.2015.12.020openalex-snapshot
A note on hierarchical hubbing for a generalization of the VPN problem
inferred← citeshttps://doi.org/10.1109/cse.2015.23openalex-snapshot
The Genetic Approach for Design of Virtual Private Networks
inferred← citeshttps://doi.org/10.1145/3452296.3472918openalex-snapshot
Capacity-efficient and uncertainty-resilient backbone network planning with hose
inferred← citeshttps://doi.org/10.1145/3603269.3604854openalex-snapshot
Hose-based cross-layer backbone network design with Benders decomposition
inferred← citeshttps://doi.org/10.1287/moor.2013.0620openalex-snapshot
Approximability of Robust Network Design
inferred← citeshttps://doi.org/10.22028/d291-25947openalex-snapshot
Analyses of evolutionary algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1406.7841openalex-snapshot
A note on hierarchical hubbing for a generalization of the VPN problem
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.