{"id":"W2915860730","doi":"10.1007/s00453-020-00785-5","title":"Travelling on Graphs with Small Highway Dimension","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Dimension (graph theory); Steiner tree problem; Theory of computation; Combinatorics; Mathematics; Graph; Polynomial; Approximation algorithm; Scheme (mathematics); Time complexity; Tree (set theory); Polynomial-time approximation scheme; Shortest path problem; Metric dimension; Discrete mathematics; Pathwidth; Line graph; Algorithm","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.0006153745,0.0006205051,0.001364995,0.002176041,0.001886967,0.003239984,0.001956508,0.002109551,0.01147006],"category_scores_gemma":[0.009282851,0.0008034376,0.0009242134,0.00237409,0.00184678,0.006353933,0.002435376,0.00193628,0.001064164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001900053,"about_ca_system_score_gemma":0.0009237921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003994368,"about_ca_topic_score_gemma":0.004647529,"domain_scores_codex":[0.9993426,0.0002151867,0.00003031762,0.000148674,0.00009853195,0.0001647192],"domain_scores_gemma":[0.9901628,0.006806716,0.0009201748,0.0008246065,0.0004565291,0.0008291021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005405325,0.0001677047,0.004138659,0.0005305826,0.00013728,0.0003472543,0.0005565984,0.1352187,0.004300883,0.8151775,0.01853688,0.02034749],"study_design_scores_gemma":[0.0001089662,0.00004104799,0.001501776,0.00004542264,0.00006306141,0.0002039584,0.0003892476,0.2558709,0.00120086,0.7354172,0.005124801,0.00003270553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8439456,0.001141787,0.109916,0.003660094,0.0001678661,0.0001489061,0.002061615,0.000557059,0.03840093],"genre_scores_gemma":[0.9434898,0.001211148,0.03644283,0.0004074175,0.0001809103,0.0002013383,0.001626704,0.0002323032,0.01620754],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01147006,"threshold_uncertainty_score":0.03837115,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02525317334317673,"score_gpt":0.2192488803682884,"score_spread":0.1939957070251116,"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."}}