{"id":"W2099335235","doi":"10.1007/s10107-007-0106-8","title":"Approximation algorithms for general packing problems and their application to the multicast congestion problem","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Solver; Approximation algorithm; Mathematics; Block (permutation group theory); Steiner tree problem; Logarithm; Combinatorics; Regular polygon; Algorithm; Discrete mathematics; Mathematical optimization; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006679699,0.002112066,0.002471153,0.003578694,0.001736605,0.004904544,0.004119443,0.004255189,0.006325046],"category_scores_gemma":[0.04122058,0.00146564,0.002867367,0.007793707,0.002982877,0.009262809,0.003547474,0.007875432,0.0009225691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004269031,"about_ca_system_score_gemma":0.002383222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004168595,"about_ca_topic_score_gemma":0.004230979,"domain_scores_codex":[0.997003,0.001428914,0.00012572,0.0003516864,0.0007654889,0.0003251473],"domain_scores_gemma":[0.9773284,0.01851595,0.001202964,0.001406161,0.001065676,0.0004808608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002645025,0.0003534314,0.001071546,0.0003454747,0.0001070986,0.00007751711,0.0003560325,0.3851832,0.0008199898,0.4734344,0.01415257,0.1238342],"study_design_scores_gemma":[0.00004200886,0.00002679235,0.0001709514,0.00003764669,0.00002825661,0.00006058941,0.00004549299,0.7045528,0.0002272934,0.2920906,0.002700409,0.00001717096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01636813,0.003772407,0.9655235,0.002471411,0.0003458041,0.0001071723,0.0001563831,0.0003394065,0.01091578],"genre_scores_gemma":[0.2452482,0.00692368,0.730673,0.001021199,0.001896982,0.0006985887,0.0007088165,0.0005748604,0.01225464],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006679699,"threshold_uncertainty_score":0.03532606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04118625576138175,"score_gpt":0.2885665262119343,"score_spread":0.2473802704505526,"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."}}