On the public citation graph

Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees

0 signed · 50 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.1006/jagm.1998.0930openalex-snapshot
Bicriteria Network Design Problems
inferredcites →https://doi.org/10.1007/3-540-45753-4_16openalex-snapshot
Minimum Restricted Diameter Spanning Trees
inferredcites →https://doi.org/10.1007/s00453-002-0968-3openalex-snapshot
Approximation Algorithms for Access Network Design
inferredcites →https://doi.org/10.1007/s004530010050openalex-snapshot
The Dense k -Subgraph Problem
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.011openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1016/s0304-3975(99)00130-9openalex-snapshot
Generalized submodular cover problems and applications
inferredcites →https://doi.org/10.1109/focs.2004.32openalex-snapshot
Hardness of Buy-at-Bulk Network Design
inferredcites →https://doi.org/10.1109/focs.2006.15openalex-snapshot
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
inferredcites →https://doi.org/10.1109/sfcs.1996.548489openalex-snapshot
A 3-approximation for the minimum tree spanning k vertices
inferredcites →https://doi.org/10.1109/sfcs.1997.646143openalex-snapshot
Buy-at-bulk network design
inferredcites →https://doi.org/10.1109/sfcs.2000.892328openalex-snapshot
Hierarchical placement and network design problems
inferredcites →https://doi.org/10.1109/sfcs.2000.892330openalex-snapshot
Cost-distance: two metric network design
inferredcites →https://doi.org/10.1109/sfcs.2002.1181956openalex-snapshot
A constant-factor approximation algorithm for the multicommodity rent-or-buy problem
inferredcites →https://doi.org/10.1109/sfcs.2003.1238233openalex-snapshot
Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem
inferredcites →https://doi.org/10.1137/s0097539702420474openalex-snapshot
Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
inferredcites →https://doi.org/10.1137/s009753979528826xopenalex-snapshot
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
inferredcites →https://doi.org/10.1137/s0895480194266331openalex-snapshot
Spanning Trees—Short or Small
inferredcites →https://doi.org/10.1137/s1052623497321432openalex-snapshot
Approximating the Single-Sink Link-Installation Problem in Network Design
inferredcites →https://doi.org/10.1137/sioptopenalex-snapshot
SIAM Journal on Optimization
inferredcites →https://doi.org/10.1145/1060590.1060617openalex-snapshot
On non-uniform multicommodity buy-at-bulk network design
inferredcites →https://doi.org/10.1145/1060590.1060650openalex-snapshot
Saving an epsilon
inferredcites →https://doi.org/10.1145/1109557.1109626openalex-snapshot
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
inferredcites →https://doi.org/10.1145/237814.237992openalex-snapshot
A constant-factor approximation algorithm for the k MST problem (extended abstract)
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
inferredcites →https://doi.org/10.1145/380752.380826openalex-snapshot
Approximation algorithms for constrained for constrained node weighted steiner tree problems
inferredcites →https://doi.org/10.1145/380752.380827openalex-snapshot
A constant factor approximation for the single sink edge installation problems
inferredcites →https://doi.org/10.1145/780542.780597openalex-snapshot
Simpler and better approximation algorithms for network design
inferredcites →https://doi.org/10.1287/moor.17.1.36openalex-snapshot
Approximation Schemes for the Restricted Shortest Path Problem
inferredcites →https://doi.org/10.5555/1070432.1070568openalex-snapshot
On the approximability of some network design problems
inferredcites →https://doi.org/10.5555/1109557.1109626openalex-snapshot
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
inferredcites →https://doi.org/10.5555/314161.314397openalex-snapshot
Buy-at-bulk network design: approximating the single-sink edge installation problem
inferredcites →https://doi.org/10.5555/365411.365452openalex-snapshot
A deterministic algorithm for the cost-distance problem

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-27119-4_39openalex-snapshot
Improved Approximating Algorithms for Computing Energy Constrained Minimum Cost Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_18openalex-snapshot
Approximating Some Network Design Problems with Node Costs
inferred← citeshttps://doi.org/10.1007/s00224-015-9615-7openalex-snapshot
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.013openalex-snapshot
Approximating some network design problems with node costs
inferred← citeshttps://doi.org/10.1109/focs.2006.15openalex-snapshot
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00056openalex-snapshot
Hop-Constrained Metric Embeddings and their Applications
inferred← citeshttps://doi.org/10.1109/paap.2014.52openalex-snapshot
Approximating the Shallow-Light Steiner Tree Problem When Cost and Delay are Linearly Dependent
inferred← citeshttps://doi.org/10.1109/pdcat.2014.17openalex-snapshot
On the Shallow-Light Steiner Tree Problem
inferred← citeshttps://doi.org/10.1137/070700620openalex-snapshot
Survivable Network Design with Degree or Order Constraints
inferred← citeshttps://doi.org/10.1137/21m1425487openalex-snapshot
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics
inferred← citeshttps://doi.org/10.1145/1250790.1250886openalex-snapshot
Survivable network design with degree or order constraints
inferred← citeshttps://doi.org/10.1145/1347082.1347141openalex-snapshot
Set connectivity problems in undirected graphs and the directed Steiner network problem
inferred← citeshttps://doi.org/10.1145/1921659.1921664openalex-snapshot
Set connectivity problems in undirected graphs and the directed steiner network problem
inferred← citeshttps://doi.org/10.1145/2755573.2755608openalex-snapshot
Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths
inferred← citeshttps://doi.org/10.48550/arxiv.1212.3403openalex-snapshot
A Parameterized Approximation Algorithm for The Shallow-Light Steiner Tree Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1504.05519openalex-snapshot
Efficient Approximation Algorithms for Computing \emph{k} Disjoint Restricted Shortest Paths
inferred← citeshttps://doi.org/10.5555/1283383.1283519openalex-snapshot
Approximation algorithms for node-weighted buy-at-bulk network design
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.