On the public citation graph

A Truthful (2–2/k)-Approximation Mechanism for the Steiner Tree Problem with k Terminals

0 signed · 35 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.1006/game.1999.0790openalex-snapshot
Algorithmic Mechanism Design
inferredcites →https://doi.org/10.1007/11549468_103openalex-snapshot
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem
inferredcites →https://doi.org/10.1007/11549468_83openalex-snapshot
Flexible Skeletal Programming with eSkel
inferredcites →https://doi.org/10.1007/bf01726210openalex-snapshot
Multipart pricing of public goods
inferredcites →https://doi.org/10.1007/s00453-004-1099-9openalex-snapshot
Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures
inferredcites →https://doi.org/10.1016/0020-0190(82)90137-5openalex-snapshot
Sensitivity analysis of minimum spanning trees and shortest path trees
inferredcites →https://doi.org/10.1016/0167-6377(89)90065-5openalex-snapshot
The k most vital arcs in the shortest path problem
inferredcites →https://doi.org/10.1016/0167-6377(90)90074-fopenalex-snapshot
The k most vital arcs in the shortest path problem
inferredcites →https://doi.org/10.1016/s0020-0190(00)00175-7openalex-snapshot
A faster computation of the most vital edge of a shortest path
inferredcites →https://doi.org/10.1109/sfcs.2001.959899openalex-snapshot
Vickrey prices and shortest paths: what is an edge worth?
inferredcites →https://doi.org/10.1111/j.1540-6261.1961.tb02789.xopenalex-snapshot
COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS
inferredcites →https://doi.org/10.1137/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1145/1023720.1023745openalex-snapshot
Truthful multicast routing in selfish wireless networks
inferredcites →https://doi.org/10.1145/276698.276764openalex-snapshot
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
inferredcites →https://doi.org/10.1145/352871.352898openalex-snapshot
Computationally feasible VCG mechanisms
inferredcites →https://doi.org/10.1145/355541.355562openalex-snapshot
A minimum spanning tree algorithm with inverse-Ackermann type complexity
inferredcites →https://doi.org/10.1145/601819.601830openalex-snapshot
ACM SIGACT news distributed computing column 9
inferredcites →https://doi.org/10.2307/1911219openalex-snapshot
Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods
inferredcites →https://doi.org/10.2307/1914085openalex-snapshot
Incentives in Teams
inferredcites →https://doi.org/10.5555/545381.545417openalex-snapshot
Computing shortest paths with comparisons and additions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11549468_103openalex-snapshot
Efficient Truthful Mechanisms for the Single-Source Shortest Paths Tree Problem
inferred← citeshttps://doi.org/10.1007/11780823_23openalex-snapshot
On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem
inferred← citeshttps://doi.org/10.1007/11922377_3openalex-snapshot
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem
inferred← citeshttps://doi.org/10.1007/11944874_2openalex-snapshot
Dynamic Mechanism Design
inferred← citeshttps://doi.org/10.1007/11944874_34openalex-snapshot
Strongly Polynomial-Time Truthful Mechanisms in One Shot
inferred← citeshttps://doi.org/10.1007/s00291-020-00597-7openalex-snapshot
Strategyproof auction mechanisms for network procurement
inferred← citeshttps://doi.org/10.1007/s00453-007-9016-7openalex-snapshot
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.029openalex-snapshot
Dynamic mechanism design
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.034openalex-snapshot
Strongly polynomial-time truthful mechanisms in one shot
inferred← citeshttps://doi.org/10.1080/15427951.2008.10129173openalex-snapshot
Approximate Mechanisms for the Graphical TSP and Other Graph-Traversal Problems
inferred← citeshttps://doi.org/10.1145/1073970.1073999openalex-snapshot
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25729openalex-snapshot
Truthful Mechanisms for Steiner Tree Problems
inferred← citeshttps://doi.org/10.30844/wi_2020_c4-bichleropenalex-snapshot
Incentive-Compatible Auction Mechanisms for Network Procurement
inferred← citeshttps://doi.org/10.4016/10193.01openalex-snapshot
Dynamic Mechanism Design
inferred← citeshttps://doi.org/10.5281/zenodo.198178openalex-snapshot
FIGURE 2. Hippolyte obliquimanus. Zoea I in Revision of the larval morphology (Zoea I) of the family Hippolytidae (Decapoda, Caridea), with a description of the first stage of the shrimp Hippolyte obliquimanus Dana, 1852
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.