{"id":"W1993150073","doi":"10.1007/s00224-001-0008-8","title":"A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders","year":2001,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Row; Combinatorics; Time complexity; Grid; Vertex (graph theory); Partition (number theory); Mathematics; Minimum weight; Dynamic programming; Running time; Graph; Algorithm; Discrete mathematics; Computer science","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.0006863761,0.001022838,0.001295841,0.0014229,0.001023826,0.001681797,0.002135293,0.0009001164,0.0109538],"category_scores_gemma":[0.002963174,0.0009078005,0.0008496613,0.00218082,0.0007507213,0.002729017,0.002530827,0.001403912,0.002942512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001315589,"about_ca_system_score_gemma":0.001467246,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002350696,"about_ca_topic_score_gemma":0.004642892,"domain_scores_codex":[0.9993654,0.0001151109,0.00005208903,0.0001301239,0.0001927939,0.0001445165],"domain_scores_gemma":[0.9985994,0.0005720785,0.0001012276,0.000369942,0.0002100992,0.0001473343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009703039,0.0002669379,0.0009888608,0.0006865377,0.00008079626,0.0001041761,0.0004360153,0.0768435,0.02849793,0.05837017,0.02718794,0.8055669],"study_design_scores_gemma":[0.0003728312,0.0003488128,0.001090091,0.0001371992,0.0001022136,0.0003736634,0.0004773278,0.683127,0.02498955,0.2640815,0.02482331,0.00007652541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0286798,0.0003683321,0.9597318,0.0003494949,0.00006956494,0.0002423354,0.0006428284,0.00308266,0.006833078],"genre_scores_gemma":[0.1151512,0.0001887251,0.8772628,0.0001212306,0.00003065879,0.000166389,0.001526945,0.0004139647,0.005138119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0109538,"threshold_uncertainty_score":0.03664416,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.015498261918101,"score_gpt":0.245272595252124,"score_spread":0.229774333334023,"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."}}