On the public citation graph

A Constant Factor Approximation for the Single Sink Edge Installation Problem

0 signed · 46 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.1007/3-540-45535-3_14openalex-snapshot
On the Integrality Gap of a Natural Formulation of the Single-sink Buy-at-Bulk Network Design Problem
inferredcites →https://doi.org/10.1007/3-540-45753-4_20openalex-snapshot
Improved Approximation Algorithms for Metric Facility Location Problems
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.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.1997.646143openalex-snapshot
Buy-at-bulk network design
inferredcites →https://doi.org/10.1109/sfcs.1998.743427openalex-snapshot
The access network design problem
inferredcites →https://doi.org/10.1109/sfcs.2000.892328openalex-snapshot
Hierarchical placement and network design problems
inferredcites →https://doi.org/10.1109/sfcs.2000.892329openalex-snapshot
Building Steiner trees with incomplete global knowledge
inferredcites →https://doi.org/10.1109/sfcs.2000.892330openalex-snapshot
Cost-distance: two metric network design
inferredcites →https://doi.org/10.1145/1060590.1060617openalex-snapshot
On non-uniform multicommodity buy-at-bulk network design
inferredcites →https://doi.org/10.1145/129712.129787openalex-snapshot
e-approximations with minimum packing constraint violation (extended abstract)
inferredcites →https://doi.org/10.1145/258533.258600openalex-snapshot
Approximation algorithms for facility location problems (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.380827openalex-snapshot
A constant factor approximation for the single sink edge installation problems
inferredcites →https://doi.org/10.1145/780542.780608openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferredcites →https://doi.org/10.1145/780596.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-030-80879-2_13openalex-snapshot
An Improved Approximation Algorithm for the Uniform Cost-Distance Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_42openalex-snapshot
Network Design via Core Detouring for Problems without a Core
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_20openalex-snapshot
Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
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-38016-7_21openalex-snapshot
Improved Approximation Guarantees for Lower-Bounded Facility Location
inferred← citeshttps://doi.org/10.1007/s00453-018-0458-xopenalex-snapshot
LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk 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.dam.2016.05.016openalex-snapshot
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106209openalex-snapshot
Two-level hub Steiner trees
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.sorms.2010.06.001openalex-snapshot
Approximation algorithms for network design: A survey
inferred← citeshttps://doi.org/10.1109/focs.2010.62openalex-snapshot
One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk
inferred← citeshttps://doi.org/10.1109/focs.2015.40openalex-snapshot
Online Buy-at-Bulk Network Design
inferred← citeshttps://doi.org/10.1109/infocom.2008.46openalex-snapshot
On Survivable Access Network Design: Complexity and Algorithms
inferred← citeshttps://doi.org/10.1137/090750317openalex-snapshot
Approximation Algorithms for Nonuniform Buy-at-Bulk 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.1137/1.9781611975994.63openalex-snapshot
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
inferred← citeshttps://doi.org/10.1137/16m1117317openalex-snapshot
Online Buy-at-Bulk Network Design
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.1287/ijoc.2017.0752openalex-snapshot
Exact Approaches for Designing Multifacility Buy-at-Bulk Networks
inferred← citeshttps://doi.org/10.1287/moor.1110.0484openalex-snapshot
Buy-at-Bulk Network Design with Protection
inferred← citeshttps://doi.org/10.1287/moor.1110.0490openalex-snapshot
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
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.25148/etd.fidc001808openalex-snapshot
Oblivious Network Optimization and Security Modeling in Sustainable Smart Grids and Cities
inferred← citeshttps://doi.org/10.4086/toc.2012.v008a015openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2011.28openalex-snapshot
Approximation Algorithms for Union and Intersection Covering Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1104.3128openalex-snapshot
Improved Approximation Guarantees for Lower-Bounded Facility Location
inferred← citeshttps://doi.org/10.48550/arxiv.1509.03212openalex-snapshot
Online 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.