{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002002636,0.001408121,0.003197005,0.00102112,0.001178335,0.002220207,0.004263882,0.001511574,0.003593259],"category_scores_gemma":[0.006214056,0.00066079,0.00111044,0.002828082,0.0007403998,0.003791936,0.002074113,0.001921439,0.0004504914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002931911,"about_ca_system_score_gemma":0.003425856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005488538,"about_ca_topic_score_gemma":0.007411344,"domain_scores_codex":[0.9979736,0.0005149982,0.0001126918,0.0004659161,0.0005546145,0.0003781201],"domain_scores_gemma":[0.9965692,0.002081526,0.0002547613,0.0005318323,0.0003485081,0.0002142184],"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.001299672,0.0004470191,0.0009202948,0.0008613442,0.0001730187,0.0001758513,0.0003302825,0.7872064,0.006841787,0.03919378,0.01366817,0.1488824],"study_design_scores_gemma":[0.00008453406,0.00007429746,0.0001002583,0.0000120935,0.00003231176,0.0000566246,0.00005079695,0.9848092,0.0008896177,0.01313072,0.0007495863,0.000009835132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06183627,0.001360301,0.9282476,0.001140445,0.0002630868,0.0003897168,0.0006923771,0.001400411,0.00466971],"genre_scores_gemma":[0.6149799,0.0007823223,0.3784615,0.0003367357,0.0001630956,0.0004800433,0.001197743,0.0001951306,0.003403435],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005488538,"threshold_uncertainty_score":0.0212726,"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."}}