{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001824729,0.0001746752,0.0001774761,0.00008630644,0.0003796783,0.0003572622,0.000425519,0.00006688501,9.761501e-7],"category_scores_gemma":[0.0001129732,0.0001151091,0.00006336626,0.0003927211,0.00008504967,0.000231721,0.0001969607,0.0001308222,0.000008998682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003421976,"about_ca_system_score_gemma":0.000009896177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007099392,"about_ca_topic_score_gemma":0.00001276444,"domain_scores_codex":[0.9985663,0.00003293559,0.000374087,0.0004001437,0.0002086002,0.0004179458],"domain_scores_gemma":[0.9988758,0.0003976476,0.0001080434,0.0003691529,0.0001238239,0.0001255148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002889637,0.00007467062,0.00001052977,0.0001061368,0.00000893914,2.207218e-7,0.002351936,0.00006965149,0.000354852,0.2423436,0.000008288049,0.7546683],"study_design_scores_gemma":[0.0002560866,0.0001239984,0.0001214683,0.00007406611,0.000009316369,0.00003172635,0.000214723,0.7722433,0.0009751397,0.2157225,0.01001575,0.0002119693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003123886,0.00005075298,0.992243,0.001691848,0.00006069265,0.002474872,0.000001965227,0.0002193777,0.0001336261],"genre_scores_gemma":[0.1510773,0.00000113341,0.848053,0.0001161486,0.0001336991,0.0005753404,0.000006466084,0.00001387599,0.00002295845],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7721736,"threshold_uncertainty_score":0.4694011,"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."}}