On the public citation graph
Set Covering with Our Eyes Closed
0 signed · 41 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.1007/bf01581035openalex-snapshot
Heuristics for the fixed cost median problem
inferredcites →https://doi.org/10.1007/bf02570718openalex-snapshot
Almost optimal set covers in finite VC-dimension
inferredcites →https://doi.org/10.1007/s00453-004-1110-5openalex-snapshot
Approximating Min Sum Set Cover
inferredcites →https://doi.org/10.1007/s00453-007-9049-yopenalex-snapshot
On the Competitive Ratio for Online Facility Location
inferredcites →https://doi.org/10.1007/s00453-007-9076-8openalex-snapshot
Tight Results on Minimum Entropy Set Cover
inferredcites →https://doi.org/10.1016/0012-365x(75)90058-8openalex-snapshot
On the ratio of optimal integral and fractional covers
inferredcites →https://doi.org/10.1016/0167-6377(89)90047-3openalex-snapshot
Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.010openalex-snapshot
Optimal oblivious routing in polynomial time
inferredcites →https://doi.org/10.1016/j.orl.2007.04.009openalex-snapshot
Algorithms for the universal and a priori TSP
inferredcites →https://doi.org/10.1016/j.tcs.2005.09.015openalex-snapshot
The minimum-entropy set cover problem
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1111/j.1468-0394.2006.00404_7.xopenalex-snapshot
Languages and programming
inferredcites →https://doi.org/10.1145/1086649.1086670openalex-snapshot
SIGACT news online algorithms column 8
inferredcites →https://doi.org/10.1145/1109557.1109628openalex-snapshot
Improved lower and upper bounds for universal TSP in planar metrics
inferredcites →https://doi.org/10.1145/1198513.1198522openalex-snapshot
A general approach to online network optimization problems
inferredcites →https://doi.org/10.1145/1217856.1217860openalex-snapshot
An approximation scheme for stochastic linear programming and its application to stochastic integer programs
inferredcites →https://doi.org/10.1145/1284320.1284321openalex-snapshot
AdWords and generalized online matching
inferredcites →https://doi.org/10.1145/2455.214106openalex-snapshot
Approximation schemes for covering and packing problems in image processing and VLSI
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/76359.76361openalex-snapshot
Spacefilling curves and the planar travelling salesman problem
inferredcites →https://doi.org/10.1287/moor.1080.0363openalex-snapshot
Online Primal-Dual Algorithms for Covering and Packing
inferredcites →https://doi.org/10.1287/opre.36.6.929openalex-snapshot
A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
inferredcites →https://doi.org/10.2307/1402748openalex-snapshot
The Secretary Problem and Its Extensions: A Review
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-031-24383-7_26openalex-snapshot
Incentive Mechanism Design for Uncertain Tasks in Mobile Crowd Sensing Systems Utilizing Smart Contract in Blockchain
inferred← citeshttps://doi.org/10.1007/978-3-662-53354-3_26openalex-snapshot
Designing Cost-Sharing Methods for Bayesian Games
inferred← citeshttps://doi.org/10.1007/s00224-017-9832-3openalex-snapshot
Designing Cost-Sharing Methods for Bayesian Games
inferred← citeshttps://doi.org/10.1109/msn60784.2023.00103openalex-snapshot
Edge Servers on Wheels: Deployment and Route Planning of Mobile Servers for Internet of Vehicles
inferred← citeshttps://doi.org/10.1109/tsc.2024.3376199openalex-snapshot
Incentive Mechanism for Uncertain Tasks Under Differential Privacy
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch91openalex-snapshot
Algorithmic Complexity of Power Law Networks
inferred← citeshttps://doi.org/10.1145/2688073.2688104openalex-snapshot
Robust Hierarchical k-Center Clustering
inferred← citeshttps://doi.org/10.14569/ijarai.2015.040607openalex-snapshot
A Heuristic Approach for Minimum Set Cover Problem
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.67openalex-snapshot
Stochastic Online Metric Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1807.03839openalex-snapshot
Online Facility Location with Deletions
inferred← citeshttps://doi.org/10.48550/arxiv.1807.08543openalex-snapshot
Set Cover with Delay -- Clairvoyance is not Required
inferred← citeshttps://doi.org/10.5555/2884435.2884526openalex-snapshot
Algorithmic complexity of power law networks
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.