{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413799,0.0001425538,0.0003878236,0.0001212103,0.0001390407,0.00005926902,0.0006991375,0.00006294304,0.000009256883],"category_scores_gemma":[0.00004222399,0.0001305946,0.0001070736,0.000231683,0.00008096457,0.0002176283,0.0002188395,0.00006474085,0.000009719426],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002093241,"about_ca_system_score_gemma":0.00005037088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006963706,"about_ca_topic_score_gemma":2.163888e-7,"domain_scores_codex":[0.9984594,0.0001968969,0.0005346631,0.0002874968,0.0002417861,0.0002797766],"domain_scores_gemma":[0.9983971,0.0004608965,0.0004321628,0.0005114395,0.0001319502,0.00006650134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001078211,0.0003878257,0.0002343028,0.0004253986,0.0002499996,0.00001926433,0.00510811,0.01541721,0.01283375,0.07415882,0.01422433,0.8768331],"study_design_scores_gemma":[0.0006137718,0.0001601651,0.000251516,0.0004038638,0.0000135188,0.0000448031,0.0001555818,0.99256,0.001822248,0.001350942,0.002441616,0.0001819507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02291954,0.0003328981,0.9746537,0.00003446991,0.0006013167,0.0003027674,0.00002100714,0.0001125142,0.001021788],"genre_scores_gemma":[0.8655738,0.000005124827,0.1335915,0.00002335264,0.000280304,0.000009242574,0.00001551091,0.00001789994,0.0004831974],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9771428,"threshold_uncertainty_score":0.5325493,"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."}}