{"id":"W1165108992","doi":"10.53846/goediss-5126","title":"Randomized Approximation and Online Algorithms for Assignment Problems","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Randomized rounding; Generalized assignment problem; Competitive analysis; Online algorithm; Randomized algorithm; Mathematics; Approximation algorithm; Assignment problem; Disjoint sets; Rounding; Mathematical optimization; Integer programming; Scheduling (production processes); Separable space; Generalization; Linear bottleneck assignment problem; Weapon target assignment problem; Algorithm; Computer science; Upper and lower bounds; Combinatorics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00128757,0.0002245981,0.0005005055,0.0001818438,0.00009226622,0.0003073696,0.0003521398,0.0001874225,0.00001464204],"category_scores_gemma":[0.0001703616,0.0001734155,0.00009544375,0.000162702,0.00002723013,0.0003494633,0.00005132125,0.0001329879,0.000006173723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005056262,"about_ca_system_score_gemma":0.0001946731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002108036,"about_ca_topic_score_gemma":0.00003845744,"domain_scores_codex":[0.9982921,0.0001256396,0.000455914,0.0004655815,0.000433553,0.0002271509],"domain_scores_gemma":[0.9986933,0.0001670398,0.0002459269,0.0002674301,0.0004961104,0.0001302056],"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.00791652,0.001179269,0.000003259485,0.002973373,0.0005796695,0.000002932374,0.01617941,0.00674005,0.0002530488,0.3260994,0.02241447,0.6156586],"study_design_scores_gemma":[0.05539496,0.00008323635,0.000001838304,0.00008106785,0.00002455006,0.000001438268,0.000157135,0.9088346,0.0001000225,0.03269296,0.002374973,0.0002532516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007742881,0.0003762963,0.9885042,0.0005847396,0.00043837,0.003317665,0.000014684,0.0001842133,0.006502432],"genre_scores_gemma":[0.001170994,0.0004802344,0.9317666,0.0002433328,0.0001393211,0.001544297,0.00457608,0.00004770399,0.0600314],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9020945,"threshold_uncertainty_score":0.7071678,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0565866783259216,"score_gpt":0.3363461507125681,"score_spread":0.2797594723866466,"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."}}