{"id":"W2963874686","doi":"","title":"Min-Max Latency Walks: Approximation Algorithms for Monitoring Vertex-Weighted Graphs","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex (graph theory); Combinatorics; Neighbourhood (mathematics); Approximation algorithm; Feedback vertex set; Mathematics; Vertex cover; Graph; Binary logarithm; Discrete mathematics","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.00173333,0.002332958,0.001576227,0.001368771,0.0009804037,0.001834528,0.003007179,0.001928976,0.002947979],"category_scores_gemma":[0.008197383,0.00101886,0.0009854236,0.002854586,0.001032061,0.004720647,0.002187191,0.001857394,0.00095997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001732192,"about_ca_system_score_gemma":0.001554447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00388472,"about_ca_topic_score_gemma":0.005675085,"domain_scores_codex":[0.9986914,0.0004150801,0.00008057192,0.0003441015,0.0002429993,0.0002259021],"domain_scores_gemma":[0.9968706,0.00186717,0.0003842425,0.0004990174,0.0001683902,0.00021062],"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.0005457075,0.0002547977,0.001760548,0.0002486031,0.00008744635,0.00009969444,0.0001960209,0.8496197,0.002329964,0.02848141,0.004626563,0.1117495],"study_design_scores_gemma":[0.0000365323,0.00004962207,0.0001111595,0.00001291092,0.00001322008,0.00004435953,0.00003456256,0.960358,0.0006245665,0.0379045,0.0008027542,0.000007768309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0248125,0.0005937318,0.9706404,0.000300765,0.00004372273,0.0001311716,0.0002671498,0.001770987,0.001439573],"genre_scores_gemma":[0.3861858,0.0006425548,0.6075616,0.0002149178,0.00007355645,0.0004247362,0.001155921,0.0004770674,0.003263787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00388472,"threshold_uncertainty_score":0.01256794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.091024929247383,"score_gpt":0.2135351025754776,"score_spread":0.1225101733280946,"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."}}