MétaCan
Menu
Back to cohort
Record W2172037166

Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks

2011· article· en· W2172037166 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueCanadian Conference on Computational Geometry · 2011
Typearticle
Languageen
FieldEngineering
TopicMechanical Behavior of Composites
Canadian institutionsUniversity of New Brunswick
Fundersnot available
KeywordsApproximation algorithmSet (abstract data type)Unit (ring theory)RADIUSAlgorithmSimple (philosophy)MathematicsTime complexityCombinatoricsConstant (computer programming)Running timePolynomialFactor (programming language)Computer scienceDiscrete mathematicsMathematical analysis
DOInot available

Abstract

fetched live from OpenAlex

In this note, we shall consider constant factor approximation algorithms for a variation of the discrete piercing set problem for unit disks. Here a set of points P is given; the objective is to choose minimum number of points inP to pierce all the disks of unit radius centered at the points in P . We rst propose a very simple algorithm that produces a 14-factor approximation result in O(n logn) time. Next, we improve the approximation factor to 4 and then to 3. Both algorithms run in polynomial time.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.931
Threshold uncertainty score0.583

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.102
GPT teacher head0.283
Teacher spread0.181 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it