On the public citation graph
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
0 signed · 94 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/11830924_16openalex-snapshot
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
inferredcites →https://doi.org/10.1007/3-540-47867-1_33openalex-snapshot
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
inferredcites →https://doi.org/10.1007/978-3-642-03685-9_18openalex-snapshot
Approximating Some Network Design Problems with Node Costs
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.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
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.1109/focs.2004.32openalex-snapshot
Hardness of Buy-at-Bulk Network Design
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.2001.959908openalex-snapshot
An iterative rounding 2-approximation algorithm for the element connectivity problem
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/s0097539792224474openalex-snapshot
A Graph-Theoretic Game and Its Application to the k -Server 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.1142/9789812796936_others05openalex-snapshot
Combinatorial 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/1109557.1109626openalex-snapshot
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
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
inferredcites →https://doi.org/10.1145/301250.301406openalex-snapshot
Efficient recovery from power outage (extended abstract)
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.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/1283383.1283519openalex-snapshot
Approximation algorithms for node-weighted buy-at-bulk network design
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/11830924_16openalex-snapshot
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_215openalex-snapshot
Low Stretch Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_193openalex-snapshot
Learning with the Aid of an Oracle
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_215openalex-snapshot
Low Stretch Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_10openalex-snapshot
Stochastic Steiner Tree with Non-uniform Inflation
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_30openalex-snapshot
Competitive Cost Sharing with Economies of Scale
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_15openalex-snapshot
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
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/978-3-642-19094-0_6openalex-snapshot
Oblivious Buy-at-Bulk in Planar Graphs
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-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-3-642-27848-8_215-2openalex-snapshot
Low Stretch Spanning Trees
inferred← citeshttps://doi.org/10.1007/s00453-007-9013-xopenalex-snapshot
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
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/s10878-009-9256-3openalex-snapshot
Approximating k-generalized connectivity via collapsing HSTs
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.sorms.2010.06.001openalex-snapshot
Approximation algorithms for network design: A survey
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.1016/j.tcs.2012.03.044openalex-snapshot
Approximation algorithms for orienting mixed graphs
inferred← citeshttps://doi.org/10.1109/cec.2011.5949896openalex-snapshot
Biased random-key genetic algorithm for fiber installation in Optical Network Optimization
inferred← citeshttps://doi.org/10.1109/focs.2007.21openalex-snapshot
Buy-at-Bulk Network Design with Protection
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/glocom.2007.446openalex-snapshot
Heuristics for Fiber Installation in Optical Network Optimization
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/infcom.2010.5462071openalex-snapshot
Routing for Energy Minimization in the Speed Scaling Model
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195539openalex-snapshot
On exploiting flow allocation with rate adaptation for green networking
inferred← citeshttps://doi.org/10.1109/tc.2011.64openalex-snapshot
An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs
inferred← citeshttps://doi.org/10.1109/tnet.2011.2159864openalex-snapshot
Routing for Power Minimization in the Speed Scaling Model
inferred← citeshttps://doi.org/10.1109/tpds.2013.108openalex-snapshot
An Approximation Algorithm for Constructing Degree-Dependent Node-Weighted Multicast Trees
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/20m1360645openalex-snapshot
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing
inferred← citeshttps://doi.org/10.1145/1236457.1236458openalex-snapshot
Approximation via cost sharing
inferred← citeshttps://doi.org/10.1145/1250790.1250886openalex-snapshot
Survivable network design with degree or order constraints
inferred← citeshttps://doi.org/10.1145/1324215.1324236openalex-snapshot
Routing and network design with robustness to changing or uncertain traffic demands
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/1536414.1536504openalex-snapshot
A constant-factor approximation for stochastic Steiner forest
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/2591796.2591831openalex-snapshot
Cluster before you hallucinate
inferred← citeshttps://doi.org/10.1145/2629653openalex-snapshot
Minimum Makespan Multi-Vehicle Dial-a-Ride
inferred← citeshttps://doi.org/10.1145/3357713.3384238openalex-snapshot
Approximately stable committee selection
inferred← citeshttps://doi.org/10.1155/2015/506909openalex-snapshot
Minimum Cost Data Aggregation for Wireless Sensor Networks Computing Functions of Sensed Data
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.2172/1055603openalex-snapshot
combinatorial optimization with demands (LDRD Final 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.1002.3864openalex-snapshot
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0351openalex-snapshot
An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1009.5734openalex-snapshot
Approximability of Capacitated Network Design
inferred← citeshttps://doi.org/10.48550/arxiv.1102.5450openalex-snapshot
Minimum Makespan Multi-vehicle Dial-a-Ride
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6207openalex-snapshot
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
inferred← citeshttps://doi.org/10.48550/arxiv.2102.05168openalex-snapshot
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries
inferred← citeshttps://doi.org/10.5555/1283383.1283519openalex-snapshot
Approximation algorithms for node-weighted buy-at-bulk network design
inferred← citeshttps://doi.org/10.7939/r3gb1xt6vopenalex-snapshot
Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph
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.