{"id":"W2503948570","doi":"","title":"Oblivious and non-oblivious local search for combinatorial optimization","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Submodular set function; Local search (optimization); Matroid; Greedy algorithm; Mathematical optimization; Mathematics; Approximation algorithm; Combinatorial optimization; Monotone polygon; Optimization problem; Function (biology); Maximization; Algorithm; Discrete mathematics","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.001972286,0.00118062,0.001253395,0.0007462743,0.0006257712,0.001718833,0.001851934,0.001201839,0.003454348],"category_scores_gemma":[0.0084669,0.000715012,0.001292968,0.001578376,0.002008882,0.0032779,0.002013931,0.003081495,0.0008856931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002628197,"about_ca_system_score_gemma":0.001963633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00271729,"about_ca_topic_score_gemma":0.00344119,"domain_scores_codex":[0.9979997,0.001029717,0.00007004922,0.0003185392,0.0004227777,0.0001590734],"domain_scores_gemma":[0.9962369,0.002811733,0.000254793,0.0004930838,0.0001307488,0.000072786],"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.0001093807,0.0001266183,0.0003340805,0.0002265299,0.0000664151,0.00003782007,0.0001045672,0.805049,0.001403357,0.1327356,0.003344809,0.0564619],"study_design_scores_gemma":[0.00002807992,0.00004408989,0.00005791644,0.00001324263,0.00001161161,0.00001547001,0.00001443075,0.9329062,0.0006347507,0.06495283,0.001314099,0.000007193929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009579137,0.0008009143,0.9834796,0.0003830951,0.00002875851,0.00008798089,0.00004311921,0.0005100071,0.005087325],"genre_scores_gemma":[0.3955531,0.00164786,0.5937824,0.0004177563,0.0001157641,0.0008414881,0.000282246,0.000397225,0.006962128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003454348,"threshold_uncertainty_score":0.01906896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01641888889795221,"score_gpt":0.2714500496178985,"score_spread":0.2550311607199462,"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."}}