On the public citation graph
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
0 signed · 67 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.1995.1029openalex-snapshot
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
inferredcites →https://doi.org/10.1006/jagm.1998.0930openalex-snapshot
Bicriteria Network Design Problems
inferredcites →https://doi.org/10.1007/s00453-002-0968-3openalex-snapshot
Approximation Algorithms for Access Network Design
inferredcites →https://doi.org/10.1007/s00453-007-9013-xopenalex-snapshot
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
inferredcites →https://doi.org/10.1007/s004930170004openalex-snapshot
A Factor 2 Approximation Algorithm for the Generalized Steiner Network 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/j.jcss.2005.05.006openalex-snapshot
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferredcites →https://doi.org/10.1109/sfcs.1998.743427openalex-snapshot
The access network design problem
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/050629665openalex-snapshot
Cost-Distance: Two Metric Network Design
inferredcites →https://doi.org/10.1137/050643635openalex-snapshot
A Constant Factor Approximation for the Single Sink Edge Installation Problem
inferredcites →https://doi.org/10.1137/s0097539792236237openalex-snapshot
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1137/s0895480101393155openalex-snapshot
Tighter Bounds for Graph Steiner Tree Approximation
inferredcites →https://doi.org/10.1137/s1052623497321432openalex-snapshot
Approximating the Single-Sink Link-Installation Problem in Network Design
inferredcites →https://doi.org/10.1145/1361192.1361200openalex-snapshot
On the approximability of some network design problems
inferredcites →https://doi.org/10.1145/185675.306789openalex-snapshot
On the hardness of approximating minimization problems
inferredcites →https://doi.org/10.1145/258533.258641openalex-snapshot
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
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-030-89543-3_10openalex-snapshot
Approximation Algorithms for Priority Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-06706-7_12openalex-snapshot
Buy-at-Bulk Facility Location on Trees
inferred← citeshttps://doi.org/10.1007/978-3-032-06706-7_4openalex-snapshot
Simple Approximations for General Spanner Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_2openalex-snapshot
Approximating Directed Buy-at-Bulk Network Design
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_7openalex-snapshot
Approximability of Capacitated Network Design
inferred← citeshttps://doi.org/10.1007/978-3-642-22616-8_41openalex-snapshot
A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_4openalex-snapshot
Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
inferred← citeshttps://doi.org/10.1007/978-981-10-6147-9_3openalex-snapshot
Spider Covering Algorithms for Network Design Problems
inferred← citeshttps://doi.org/10.1007/s00453-009-9367-3openalex-snapshot
Competitive Cost Sharing with Economies of Scale
inferred← citeshttps://doi.org/10.1007/s00453-013-9862-4openalex-snapshot
Approximability of Capacitated Network Design
inferred← citeshttps://doi.org/10.1007/s10107-019-01409-9openalex-snapshot
Online covering with $$\ell _q$$-norm objectives and applications to network design
inferred← citeshttps://doi.org/10.1007/s10878-009-9256-3openalex-snapshot
Approximating k-generalized connectivity via collapsing HSTs
inferred← citeshttps://doi.org/10.1007/s10878-012-9544-1openalex-snapshot
A new approximation algorithm for the Selective Single-Sink Buy-at-Bulk problem in network design
inferred← citeshttps://doi.org/10.1007/s10878-014-9774-5openalex-snapshot
Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106209openalex-snapshot
Two-level hub Steiner trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106608openalex-snapshot
The Steiner path aggregation problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.009openalex-snapshot
Improved approximation algorithms for Directed Steiner Forest
inferred← citeshttps://doi.org/10.1109/focs.2010.61openalex-snapshot
Minimum-Cost Network Design with (Dis)economies of Scale
inferred← citeshttps://doi.org/10.1109/focs.2015.40openalex-snapshot
Online Buy-at-Bulk Network Design
inferred← citeshttps://doi.org/10.1109/icccn.2013.6614131openalex-snapshot
Elastic Network Design and Adaptive Flow Placement in Software Defined Networks
inferred← citeshttps://doi.org/10.1109/tkde.2016.2590435openalex-snapshot
Mutually Beneficial Confluent Routing
inferred← citeshttps://doi.org/10.1109/tnet.2011.2159864openalex-snapshot
Routing for Power Minimization in the Speed Scaling Model
inferred← citeshttps://doi.org/10.1137/1.9781611975994.63openalex-snapshot
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
inferred← citeshttps://doi.org/10.1137/1.9781611976465.167openalex-snapshot
Online Generalized Network Design Under (Dis)Economies of Scale
inferred← citeshttps://doi.org/10.1137/110825959openalex-snapshot
Minimum-Cost Network Design with (Dis)economies of Scale
inferred← citeshttps://doi.org/10.1137/18m1228591openalex-snapshot
Hallucination Helps: Energy Efficient Virtual Circuit Routing
inferred← citeshttps://doi.org/10.1142/s0129054111009148openalex-snapshot
APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN
inferred← citeshttps://doi.org/10.1145/2629653openalex-snapshot
Minimum Makespan Multi-Vehicle Dial-a-Ride
inferred← citeshttps://doi.org/10.1145/2755573.2755590openalex-snapshot
Fault Tolerant BFS Structures
inferred← citeshttps://doi.org/10.1145/2818375openalex-snapshot
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
inferred← citeshttps://doi.org/10.1145/3188745.3188812openalex-snapshot
Approximating generalized network design under (dis)economies of scale with applications to energy efficiency
inferred← citeshttps://doi.org/10.1145/3798129.3800925openalex-snapshot
A Polylogarithmic Approximation for Buy-at-Bulk Network Design with Protection
inferred← citeshttps://doi.org/10.1287/moor.1110.0484openalex-snapshot
Buy-at-Bulk Network Design with Protection
inferred← citeshttps://doi.org/10.1287/moor.2021.1181openalex-snapshot
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems
inferred← citeshttps://doi.org/10.1287/moor.2022.1349openalex-snapshot
Online Generalized Network Design Under (Dis)Economies of Scale
inferred← citeshttps://doi.org/10.2172/1018729openalex-snapshot
Recovery Act: Energy Efficiency of Data Networks through Rate Adaptation (EEDNRA) - Final Technical Report
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.3439openalex-snapshot
Oblivious buy-at-bulk network design algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1504.04169openalex-snapshot
Fault Tolerant BFS Structures: A Reinforcement-Backup Tradeoff
inferred← citeshttps://doi.org/10.48550/arxiv.1509.03212openalex-snapshot
Online Buy-at-Bulk Network Design
inferred← citeshttps://doi.org/10.48550/arxiv.1705.02194openalex-snapshot
Online Covering with Sum of $\ell_q$-Norm Objectives
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.