On the public citation graph
Simpler and better approximation algorithms for network design
0 signed · 14 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 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-642-03685-9_25openalex-snapshot
On the Complexity of the Asymmetric VPN Problem
inferred← citeshttps://doi.org/10.1007/s12667-016-0224-6openalex-snapshot
An economic dispatch algorithm for congestion management of smart power 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.jda.2008.12.003openalex-snapshot
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
inferred← citeshttps://doi.org/10.1016/j.orl.2009.05.006openalex-snapshot
A note on the subadditive network design problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.033openalex-snapshot
Cross-monotonic cost sharing methods for connected facility location games
inferred← citeshttps://doi.org/10.1137/050643635openalex-snapshot
A Constant Factor Approximation for the Single Sink Edge Installation Problem
inferred← citeshttps://doi.org/10.1137/1.9781611973099.118openalex-snapshot
Traffic-Redundancy Aware Network Design
inferred← citeshttps://doi.org/10.1137/1.9781611974782.38openalex-snapshot
LAST but not Least: Online Spanners for Buy-at-Bulk
inferred← citeshttps://doi.org/10.1287/moor.1060.0237openalex-snapshot
LP Rounding Approximation Algorithms for Stochastic Network Design
inferred← citeshttps://doi.org/10.1287/opre.1050.0228openalex-snapshot
Approximation Algorithms for Problems Combining Facility Location and Network Design
inferred← citeshttps://doi.org/10.25148/etd.fidc001808openalex-snapshot
Oblivious Network Optimization and Security Modeling in Sustainable Smart Grids and Cities
inferred← citeshttps://doi.org/10.32657/10356/3456openalex-snapshot
Provisioning virtual private networks in the hose model
inferred← citeshttps://doi.org/10.47749/t/unicamp.2006.400629openalex-snapshot
Aproximação e compartilhamento de custos em projeto de redes
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.