{"id":"W3036472213","doi":"10.48550/arxiv.2006.12929","title":"Approximation algorithms for general cluster routing problem","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Vertex (graph theory); Triangle inequality; Combinatorics; Approximation algorithm; Undirected graph; Graph; Routing (electronic design automation); Mathematics; Weight function; Cluster (spacecraft); Graph algorithms; Computer science; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Artificial intelligence","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.002249619,0.001662516,0.001700945,0.001486993,0.001359486,0.002783361,0.004752321,0.002462776,0.006866681],"category_scores_gemma":[0.009556258,0.0006563801,0.001358928,0.004201053,0.001257569,0.005221978,0.002157123,0.002721441,0.001181178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003940433,"about_ca_system_score_gemma":0.002876089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008649827,"about_ca_topic_score_gemma":0.008352192,"domain_scores_codex":[0.9979441,0.0004984624,0.00007864973,0.0006859582,0.0003601082,0.0004327209],"domain_scores_gemma":[0.9963068,0.002000966,0.0003738197,0.0007284193,0.000353405,0.0002366805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007614999,0.0003082222,0.002238212,0.0005519313,0.0001756293,0.0001408309,0.0003095162,0.7450584,0.00190117,0.1006218,0.03187091,0.1160619],"study_design_scores_gemma":[0.00008017324,0.00005273814,0.0002801303,0.00002254138,0.00004219179,0.0000920016,0.00008318955,0.9290686,0.000528096,0.06610673,0.003631407,0.00001210209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0854151,0.004271014,0.8824296,0.00331694,0.0003043637,0.0003224765,0.001211748,0.00215752,0.02057114],"genre_scores_gemma":[0.5674441,0.0027265,0.4126963,0.0008725886,0.0003677522,0.0004893229,0.003198924,0.0006487658,0.01155564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008649827,"threshold_uncertainty_score":0.02858996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1195008399684768,"score_gpt":0.2425905931485223,"score_spread":0.1230897531800455,"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."}}