On the public citation graph
Optimal Algorithms and Approximation Algorithms for Replica Placement with Distance Constraints in Tree Networks
0 signed · 32 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.1993.1047openalex-snapshot
How to Allocate Network Centers
inferredcites →https://doi.org/10.1006/jagm.2000.1100openalex-snapshot
Analysis of a Local Search Heuristic for Facility Location Problems
inferredcites →https://doi.org/10.1007/3-540-44436-x_4openalex-snapshot
Approximation Algorithms for Facility Location Problems
inferredcites →https://doi.org/10.1007/3-540-48777-8_8openalex-snapshot
Improved Approximation Algorithms for Capacitated Facility Location Problems
inferredcites →https://doi.org/10.1007/bf02579456openalex-snapshot
Bin packing can be solved within 1 + ε in linear time
inferredcites →https://doi.org/10.1007/s00453-009-9336-xopenalex-snapshot
Capacitated Domination Problem
inferredcites →https://doi.org/10.1016/j.ipl.2003.12.001openalex-snapshot
Approximation algorithms for a hierarchically structured bin packing problem
inferredcites →https://doi.org/10.1016/j.jpdc.2008.08.002openalex-snapshot
Optimal replica placement in hierarchical Data Grids with locality assurance
inferredcites →https://doi.org/10.1016/s1389-1286(02)00251-7openalex-snapshot
Optimal allocation of electronic content
inferredcites →https://doi.org/10.1109/71.932716openalex-snapshot
Optimal placement of replicas in trees with read, write, and storage costs
inferredcites →https://doi.org/10.1109/icpads.2006.74openalex-snapshot
Optimal placement of replicas in data grid environments with locality assurance
inferredcites →https://doi.org/10.1109/icpp.2011.36openalex-snapshot
Modeling and Practical Evaluation of a Service Location Problem in Large Scale Networks
inferredcites →https://doi.org/10.1109/ipdps.2012.95openalex-snapshot
Optimal Algorithms and Approximation Algorithms for Replica Placement with Distance Constraints in Tree Networks
inferredcites →https://doi.org/10.1109/ispan.2002.1004257openalex-snapshot
An overview of data replication on the Internet
inferredcites →https://doi.org/10.1109/sfcs.2001.959907openalex-snapshot
Facility location with nonuniform hard capacities
inferredcites →https://doi.org/10.1109/tpds.2005.126openalex-snapshot
QoS-aware replica placement for content distribution
inferredcites →https://doi.org/10.1109/tpds.2006.145openalex-snapshot
Replicated Server Placement with QoS Constraints
inferredcites →https://doi.org/10.1109/tpds.2008.25openalex-snapshot
Replica Placement and Access Policies in Tree Networks
inferredcites →https://doi.org/10.1137/s0097539703422479openalex-snapshot
Covering Problems with Hard Capacities
inferredcites →https://doi.org/10.1137/s0895480197329776openalex-snapshot
The Capacitated K -Center Problem
inferredcites →https://doi.org/10.1145/1248377.1248403openalex-snapshot
Distributed approximation of capacitated dominating sets
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
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-62127-2_2openalex-snapshot
Replica Placement on Bounded Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/s00034-018-0770-3openalex-snapshot
A Fast FPGA-Based BCD Adder
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.04.015openalex-snapshot
Toward high-performance key-value stores through GPU encoding and locality-aware encoding
inferred← citeshttps://doi.org/10.1109/glocom.2018.8647470openalex-snapshot
A Tree-Based Approach to Locate Object Replicas in a Fog Storage Infrastructure
inferred← citeshttps://doi.org/10.1109/hpec43674.2020.9286163openalex-snapshot
An Efficient LP Rounding Scheme for Replica Placement
inferred← citeshttps://doi.org/10.1109/icdcs.2014.35openalex-snapshot
Measuring and Evaluating Live Content Consistency in a Large-Scale CDN
inferred← citeshttps://doi.org/10.1109/tnsm.2019.2929823openalex-snapshot
Data Location Management Protocol for Object Stores in a Fog Computing Infrastructure
inferred← citeshttps://doi.org/10.1109/tpds.2015.2479222openalex-snapshot
Measuring and Evaluating Live Content Consistency in a Large-Scale CDN
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2014.213openalex-snapshot
Replica Placement on Directed Acyclic Graphs
showing the first 9 of 10 · page through all 10
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.