{"id":"W1987818736","doi":"10.1016/j.tcs.2011.10.010","title":"Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Polynomial-time approximation scheme; Approximation algorithm; Mathematics; Combinatorics; Shortest path problem; Routing (electronic design automation); Time complexity; Wireless sensor network; Discrete mathematics; Constant (computer programming); Scheme (mathematics); Constraint (computer-aided design); Wireless network; Polynomial; Path (computing); Graph; Wireless; Computer science; Computer network; Telecommunications","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003352499,0.0003378418,0.0004489046,0.0002337872,0.0004204757,0.000431292,0.002137274,0.0001683529,0.00003947671],"category_scores_gemma":[0.0001760171,0.0003181597,0.00009849753,0.001421182,0.002307396,0.0007727787,0.0009391825,0.000380023,0.0000236524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001872225,"about_ca_system_score_gemma":0.0001934058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009230687,"about_ca_topic_score_gemma":0.000002437505,"domain_scores_codex":[0.9961696,0.0002529225,0.0007069892,0.001157915,0.0004965237,0.001216043],"domain_scores_gemma":[0.9971009,0.001195406,0.0002556454,0.0008335526,0.0002986929,0.0003158311],"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.00004840364,0.0001050189,0.0001310554,0.00001364866,0.000009385875,0.00001385462,0.001272981,0.003081198,0.00209084,0.9585129,0.00007399239,0.03464671],"study_design_scores_gemma":[0.0009231173,0.0001597264,0.0004912915,0.0001084658,0.000005628642,0.00004546867,0.00005234132,0.9869832,0.002947996,0.007867488,0.000005073595,0.0004101529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09809158,0.000007547131,0.8986507,0.0002210101,0.0005091016,0.001044117,0.000003239385,0.0002386456,0.001234043],"genre_scores_gemma":[0.7060761,7.399839e-7,0.2933603,0.0003365693,0.0001437658,0.0000582029,0.000004046461,0.00001595651,0.000004264401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.983902,"threshold_uncertainty_score":0.999927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02154726848785673,"score_gpt":0.2491711155035148,"score_spread":0.227623847015658,"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."}}