{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004834571,0.002685945,0.003029075,0.001334263,0.001913937,0.003828408,0.004386566,0.003215136,0.009766447],"category_scores_gemma":[0.02247067,0.0011199,0.001832453,0.003472312,0.00219883,0.006563136,0.0027443,0.006127527,0.001769166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004041934,"about_ca_system_score_gemma":0.004321439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005501864,"about_ca_topic_score_gemma":0.007284049,"domain_scores_codex":[0.9935176,0.002984872,0.0002706273,0.001229397,0.001111642,0.0008858849],"domain_scores_gemma":[0.9831492,0.01303773,0.0008374103,0.001988058,0.000598687,0.0003888348],"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.0007607982,0.0009153859,0.001004735,0.000550734,0.0001813127,0.0001390174,0.0001952576,0.6012958,0.001292693,0.2558435,0.0203526,0.1174681],"study_design_scores_gemma":[0.0001938558,0.00006276328,0.0001087882,0.00003661836,0.00003378187,0.00004665843,0.00004150619,0.8509237,0.0004482442,0.1445928,0.003497147,0.0000142379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01649101,0.001925335,0.9612314,0.002600595,0.0003516708,0.0002884553,0.0004177001,0.001546273,0.01514756],"genre_scores_gemma":[0.317728,0.001603881,0.6645551,0.001217066,0.0007507037,0.001112799,0.001705541,0.0006385435,0.01068838],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009766447,"threshold_uncertainty_score":0.03267205,"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."}}