{"id":"W2124937241","doi":"10.1016/j.comgeo.2012.04.001","title":"Exact algorithms and APX-hardness results for geometric packing and covering problems","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Packing problems; Mathematics; Combinatorics; Set packing; Monotone polygon; Cover (algebra); Unit square; Rectangle; Set (abstract data type); Polygon (computer graphics); Vertex cover; Algorithm; Plane (geometry); Set cover problem; Approximation algorithm; Square (algebra); Polyhedron; Vertex (graph theory); Geometry; Computer science; Graph","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.003787407,0.003462343,0.004093077,0.002938705,0.003158102,0.007834707,0.00900288,0.004495923,0.0253943],"category_scores_gemma":[0.02564983,0.002366386,0.004289692,0.006942749,0.004556903,0.02042637,0.008745343,0.0126055,0.004031166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004495404,"about_ca_system_score_gemma":0.00339525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003983708,"about_ca_topic_score_gemma":0.003835798,"domain_scores_codex":[0.9948224,0.001143965,0.0003089659,0.001130339,0.00171704,0.0008772558],"domain_scores_gemma":[0.9802342,0.01326622,0.0009883839,0.00388632,0.0008736256,0.0007513497],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001734052,0.001150595,0.00313921,0.002073273,0.0002850914,0.0002725951,0.001114096,0.2332284,0.003464956,0.4493818,0.04993907,0.2542168],"study_design_scores_gemma":[0.0001831772,0.0001042139,0.0006714684,0.0000901823,0.00009050746,0.0001975033,0.0002293695,0.2264647,0.001431264,0.7621647,0.008333746,0.0000390826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06663244,0.005786419,0.8558244,0.007021353,0.0006989781,0.0004547839,0.002239794,0.002640861,0.05870095],"genre_scores_gemma":[0.427354,0.005751227,0.5120028,0.002091098,0.002133783,0.001994569,0.00656476,0.002095065,0.04001281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0253943,"threshold_uncertainty_score":0.08495235,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03282671474468887,"score_gpt":0.2742536335580374,"score_spread":0.2414269188133486,"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."}}