On the public citation graph
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems
0 signed · 17 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/jcss.2001.1754openalex-snapshot
Sharing the Cost of Multicast Transmissions
inferredcites →https://doi.org/10.1007/s10107-003-0479-2openalex-snapshot
Approximate k -MSTs and k -Steiner trees via the primal-dual method and Lagrangean relaxation
inferredcites →https://doi.org/10.1137/s0097539702420474openalex-snapshot
Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1137/s0895480194266331openalex-snapshot
Spanning Trees—Short or Small
inferredcites →https://doi.org/10.1145/375827.375845openalex-snapshot
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4536619openalex-extracted
2-Node-Connectivity Network Design
inferred← citeshttps://doi.org/10.1007/978-3-030-80879-2_15openalex-snapshot
2-Node-Connectivity Network Design
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_21openalex-snapshot
Approximation Algorithms for Node-Weighted Directed Steiner Problems
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_2openalex-snapshot
Approximation Algorithms for the Maximum Connected Submodular Functions
inferred← citeshttps://doi.org/10.1007/s00453-020-00683-wopenalex-snapshot
The Parameterized Hardness of the k-Center Problem in Transportation Networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.06.021openalex-snapshot
Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114367openalex-snapshot
2-node-connectivity network design
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00129openalex-snapshot
Beyond Tree Embeddings – a Deterministic Framework for Network Design with Deadlines or Delay
inferred← citeshttps://doi.org/10.1109/tafe.2024.3349566openalex-snapshot
A Trajectory-Inspired Node Deployment Strategy in Solar Insecticidal Lamps Internet of Things Under Coverage and Maintenance Cost Considerations
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1009523openalex-snapshot
Better tired than lost: Turtle ant trail networks favor coherence over short edges
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.