{"id":"W3092889289","doi":"10.4230/lipics.socg.2019.15","title":"Preconditioning for the Geometric Transportation Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computational geometry; Logarithm; Euclidean space; Transportation theory; Euclidean geometry; Mathematics; Geometric networks; Mathematical optimization; Dimension (graph theory); Geometric programming; Integer (computer science); Simple (philosophy); Approximation algorithm; Discrete mathematics; Combinatorics; Computer science; Graph theory; Algorithm; Geometry; Mathematical analysis","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.001071151,0.00118507,0.001062086,0.0004542036,0.0007372739,0.0009021569,0.001185698,0.001172309,0.01136594],"category_scores_gemma":[0.006608769,0.0003539928,0.0009094385,0.0009051161,0.001336899,0.00279805,0.001811875,0.002736511,0.001881716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001212582,"about_ca_system_score_gemma":0.001706017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003159133,"about_ca_topic_score_gemma":0.003182794,"domain_scores_codex":[0.999186,0.0002294077,0.00004509154,0.0002058328,0.0001890885,0.0001446274],"domain_scores_gemma":[0.9982358,0.0009044961,0.0001553366,0.0003935573,0.0002016745,0.0001090558],"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.0006794633,0.0002076369,0.00119889,0.0004947162,0.00004676606,0.000203679,0.0002446098,0.466137,0.006335061,0.2829699,0.02691215,0.2145703],"study_design_scores_gemma":[0.00007063679,0.0001284311,0.0001837027,0.00003305449,0.00001492706,0.00008952903,0.00004984819,0.8412498,0.001911634,0.1483696,0.007884742,0.00001403386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01554915,0.0003984718,0.9739276,0.000708674,0.0001499733,0.000101047,0.0001629345,0.0009243283,0.008077832],"genre_scores_gemma":[0.3123133,0.0009246811,0.6758497,0.0006230075,0.0002789447,0.0004319824,0.0008704181,0.0004705355,0.008237409],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01136594,"threshold_uncertainty_score":0.03802288,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01397383616257701,"score_gpt":0.2383796590727227,"score_spread":0.2244058229101456,"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."}}