{"id":"W1825657983","doi":"10.1007/978-3-319-13075-0_42","title":"Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Submodular set function; Constant (computer programming); Randomized algorithm; Computer science; Algorithm; Approximation algorithm; Deterministic algorithm; Matching (statistics); Maximization; Greedy algorithm; Online algorithm; Running time; Simple (philosophy); Mathematics; Combinatorics; Mathematical optimization","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.01279567,0.007205611,0.004552635,0.002693418,0.002694786,0.008233485,0.009906427,0.006325396,0.03154292],"category_scores_gemma":[0.05711024,0.002793639,0.00364787,0.00560659,0.005334492,0.01560201,0.01034735,0.01628965,0.006900691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007243063,"about_ca_system_score_gemma":0.006818363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002235487,"about_ca_topic_score_gemma":0.004695187,"domain_scores_codex":[0.9898296,0.003622692,0.0004764794,0.001581429,0.002875948,0.001613809],"domain_scores_gemma":[0.9560348,0.03539357,0.0009996895,0.004071036,0.002042559,0.001458357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001749711,0.0007372338,0.001041391,0.001637793,0.0002730714,0.0001866349,0.0004699469,0.2325594,0.002991469,0.5155066,0.05366942,0.1891774],"study_design_scores_gemma":[0.0002129551,0.000155541,0.0002967984,0.0002868623,0.0001007809,0.0001497225,0.00007633276,0.5382711,0.0009198182,0.4535393,0.005941072,0.00004974634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01806344,0.008221997,0.8771407,0.004071275,0.001095118,0.0004035535,0.0008564209,0.001561661,0.08858587],"genre_scores_gemma":[0.3012007,0.006975614,0.6274583,0.003714714,0.001902499,0.00246043,0.002231522,0.003210743,0.05084545],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03154292,"threshold_uncertainty_score":0.1055216,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02816901447274186,"score_gpt":0.261183686321329,"score_spread":0.2330146718485872,"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."}}