{"id":"W4207062810","doi":"10.1007/978-3-030-95018-7_17","title":"Approximation and Parameterized Algorithms for Balanced Connected Partition Problems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Parameterized complexity; Partition (number theory); Disjoint sets; Mathematics; Graph partition; Vertex (graph theory); Approximation algorithm; Discrete mathematics; Graph","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.002232898,0.002818888,0.002563375,0.00201595,0.001857033,0.005384348,0.006584489,0.003118034,0.01850076],"category_scores_gemma":[0.0144707,0.001660918,0.002147366,0.007175411,0.001959407,0.01300009,0.004722713,0.006564383,0.003383169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00433663,"about_ca_system_score_gemma":0.002767518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003834124,"about_ca_topic_score_gemma":0.005914026,"domain_scores_codex":[0.997448,0.0007663391,0.0001257076,0.0005702634,0.0006705894,0.0004191454],"domain_scores_gemma":[0.9930427,0.004337288,0.0003961426,0.001442851,0.0004198085,0.0003613185],"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.00146061,0.001032536,0.001530456,0.0009594537,0.0001804138,0.0001342027,0.0005911237,0.2470846,0.004714852,0.3159693,0.05018391,0.3761587],"study_design_scores_gemma":[0.0002656003,0.00008250173,0.000364557,0.0000813248,0.00007501315,0.0001339227,0.0001756631,0.515646,0.001438966,0.473726,0.007983567,0.00002677953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.04888396,0.002861713,0.9105178,0.00219017,0.0003139212,0.0003372373,0.001174305,0.002239611,0.03148126],"genre_scores_gemma":[0.28506,0.002619816,0.6801342,0.0007391927,0.0006014691,0.001086651,0.005463771,0.001525043,0.02276973],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01850076,"threshold_uncertainty_score":0.06189114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03474231945108298,"score_gpt":0.2855835556091444,"score_spread":0.2508412361580614,"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."}}