{"id":"W4417122901","doi":"10.1016/j.ic.2025.105397","title":"Approximation algorithms for non-sequential star packing problems","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Ministry of Science and Technology of the People's Republic of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Approximation algorithm; Star (game theory); Approximation theory; Generalization; Matching (statistics); Greedy algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.000135712,0.00008498899,0.0000807922,0.0001810952,0.0001030083,0.0001728139,0.00003374981,0.0000585234,0.0000045092],"category_scores_gemma":[0.000009965564,0.00009095003,0.0000224331,0.0001785432,0.00001179323,0.0007448897,0.000009201131,0.00004928166,0.000008058262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003372491,"about_ca_system_score_gemma":0.00001696262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003911531,"about_ca_topic_score_gemma":0.000001738742,"domain_scores_codex":[0.9994811,0.00000678823,0.0002787293,0.00005717942,0.00007542859,0.0001007989],"domain_scores_gemma":[0.9997444,0.00002571918,0.00005285469,0.00004437085,0.0001090801,0.00002361584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006715684,0.000006611194,0.00005154309,0.0005078443,0.00002401648,2.33204e-8,0.001341117,0.8106772,0.00009662101,0.005182772,0.001086419,0.1810191],"study_design_scores_gemma":[0.0006153094,0.0000161761,0.0003288216,0.00005392903,0.000008680326,8.180062e-7,0.0001105742,0.986899,0.0003465379,0.001978532,0.00954577,0.00009582038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005271293,0.00002908674,0.9879594,0.0001039953,0.0003268293,0.0004950622,0.000009806662,0.0002405364,0.005563932],"genre_scores_gemma":[0.9585481,0.00004895137,0.04042206,0.0002370519,0.00002923969,0.0001001159,0.0005456299,0.00000953354,0.00005928954],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9532768,"threshold_uncertainty_score":0.3708835,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01471242412690484,"score_gpt":0.248362056133436,"score_spread":0.2336496320065312,"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."}}