{"id":"W2059590924","doi":"10.1016/j.tcs.2010.07.017","title":"Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ϵ</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math>time","year":2010,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constant (computer programming); Minor (academic); Scroll; Grid; Planar; Mathematics; Factor (programming language); Combinatorics; Computer science; Discrete mathematics; Computer graphics (images); Geometry; Programming language; Humanities; Engineering","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.0004657926,0.001057315,0.0006859874,0.001204787,0.0005867732,0.001702927,0.001228173,0.000733412,0.01976152],"category_scores_gemma":[0.004978486,0.0003562997,0.0007661668,0.001184632,0.0006462227,0.001974851,0.001121182,0.001394641,0.004334903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001487608,"about_ca_system_score_gemma":0.000994082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008267238,"about_ca_topic_score_gemma":0.01711889,"domain_scores_codex":[0.9997275,0.00005402988,0.00001028493,0.00006308738,0.00008591075,0.00005916989],"domain_scores_gemma":[0.9985248,0.0007152421,0.0001067989,0.00029791,0.0002287846,0.000126532],"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.001823073,0.0003108999,0.006601824,0.0008292653,0.0001111382,0.0003836891,0.000936586,0.4038379,0.01358529,0.2288651,0.08353597,0.2591794],"study_design_scores_gemma":[0.00008576962,0.00007594921,0.001075801,0.00006936747,0.00002569332,0.0001507965,0.0002360434,0.8202035,0.003041063,0.1645856,0.01043239,0.00001806951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.225585,0.000980017,0.7177659,0.0008873031,0.0002243854,0.0001407526,0.00314096,0.003094004,0.04818158],"genre_scores_gemma":[0.6131095,0.0005872315,0.3577147,0.0001901904,0.000100604,0.0001490624,0.006505663,0.001546369,0.02009678],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01976152,"threshold_uncertainty_score":0.06610894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01383103064045403,"score_gpt":0.2509247616131342,"score_spread":0.2370937309726802,"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."}}