{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001963116,0.002290101,0.002012927,0.001393654,0.001287545,0.002491642,0.00354401,0.001873755,0.007092512],"category_scores_gemma":[0.00674428,0.0008799973,0.001898156,0.003340777,0.00098919,0.004117276,0.002053741,0.002192174,0.001848308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002589535,"about_ca_system_score_gemma":0.002530677,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005053192,"about_ca_topic_score_gemma":0.007043266,"domain_scores_codex":[0.9979724,0.0005003252,0.0001461003,0.0004661837,0.0004587506,0.0004562486],"domain_scores_gemma":[0.9967442,0.001808508,0.0003689138,0.0005606239,0.0002869808,0.0002307865],"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.0009878052,0.0006613829,0.001502618,0.0006394528,0.0001608558,0.0001883488,0.0003287041,0.7516991,0.003260432,0.04960602,0.0196227,0.1713425],"study_design_scores_gemma":[0.00009192536,0.00008538448,0.0001508141,0.00002223508,0.00002353907,0.00008312592,0.0000523081,0.967607,0.0008021219,0.02880341,0.002269762,0.000008406958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04658424,0.002129679,0.932436,0.001129887,0.0002729267,0.0002765861,0.0006744392,0.002489779,0.01400634],"genre_scores_gemma":[0.3520847,0.001778824,0.6311391,0.0005647765,0.0002611835,0.0005660961,0.002403932,0.000606359,0.01059499],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007092512,"threshold_uncertainty_score":0.02372682,"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."}}