{"id":"W2182520915","doi":"","title":"Exact Algorithms and APX-Hardness Results for Geometric Set Cover","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Vertex cover; Monotone polygon; Rectangle; Set cover problem; Unit square; Approximation algorithm; Time complexity; Algorithm; Line segment; Computational geometry; Square (algebra); Set (abstract data type); Computer science; Geometry","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017073,0.001635462,0.001904079,0.001330115,0.00152522,0.0038982,0.004183603,0.002492302,0.01085313],"category_scores_gemma":[0.01021631,0.000991828,0.002246971,0.003547771,0.001945439,0.00863725,0.003670435,0.004033482,0.00169672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003429004,"about_ca_system_score_gemma":0.001698565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002235943,"about_ca_topic_score_gemma":0.002266398,"domain_scores_codex":[0.9974912,0.0004866913,0.0001354844,0.000595105,0.0007691326,0.0005224257],"domain_scores_gemma":[0.9926893,0.005016669,0.0004907309,0.001244358,0.0002775503,0.0002813669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008634324,0.0005511714,0.002787593,0.001084907,0.000198913,0.0002983625,0.0006783224,0.5176022,0.005844653,0.2822325,0.02001786,0.1678401],"study_design_scores_gemma":[0.0001457508,0.0001194521,0.0005747005,0.00006807135,0.00004872743,0.000275196,0.0001540882,0.628812,0.002321183,0.361046,0.006402327,0.00003257178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08590189,0.001751602,0.8788495,0.003617311,0.0001837881,0.0003480507,0.001626385,0.002228855,0.02549254],"genre_scores_gemma":[0.5019375,0.001767316,0.4793244,0.0006977416,0.0004949982,0.0008814289,0.003663249,0.000723376,0.01051007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01085313,"threshold_uncertainty_score":0.03630739,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0761986086665031,"score_gpt":0.2723684118473931,"score_spread":0.19616980318089,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}