{"id":"W2963762723","doi":"10.1016/j.comgeo.2019.04.004","title":"Approximating dominating set on intersection graphs of rectangles and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi mathvariant=\"sans-serif\">L</mml:mi></mml:math>-frames","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Diagonal; Combinatorics; Intersection (aeronautics); Mathematics; Approximation algorithm; Line (geometry); Logarithm; Line segment; Dominating set; Discrete mathematics; Geometry; Graph; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001031563,0.0002107995,0.0001926787,0.0004508753,0.0002916791,0.0002252008,0.0005803853,0.0001818256,0.00002466124],"category_scores_gemma":[0.0004456896,0.0002493987,0.0001659102,0.0008816138,0.0002192215,0.0006235245,0.0005380035,0.0004021888,0.0001288632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001953701,"about_ca_system_score_gemma":0.0001094845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002701476,"about_ca_topic_score_gemma":0.000003916137,"domain_scores_codex":[0.9976881,0.0001257833,0.000478883,0.00057263,0.0007333372,0.0004012414],"domain_scores_gemma":[0.9975835,0.001277374,0.0004384961,0.0004497752,0.0001322085,0.0001186297],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008063077,0.00006351874,0.0001028995,0.0002400981,0.00008329355,0.00002037383,0.001018609,0.01039008,0.001078501,0.977034,0.00004092154,0.009847087],"study_design_scores_gemma":[0.0004371839,0.0003863573,0.0006307562,0.0002829502,0.00001454239,0.000130302,0.0007018743,0.9597592,0.002854574,0.03453287,0.00005352938,0.0002158896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9007998,0.0001143063,0.09707361,0.00009945204,0.0003612064,0.00007783945,0.00002470778,0.0001046021,0.0013445],"genre_scores_gemma":[0.9360763,0.0000157211,0.06351019,0.0001697688,0.00007081705,0.00004363862,0.00004963029,0.00003884153,0.00002506799],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9493691,"threshold_uncertainty_score":0.9999958,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01817942780823386,"score_gpt":0.2655638147394427,"score_spread":0.2473843869312088,"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."}}