{"id":"W4387618924","doi":"10.1016/j.tcs.2023.114254","title":"A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National University's Basic Research Foundation of China; China Scholarship Council; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Mathematics; Combinatorics; Cardinality (data modeling); Approximation algorithm; Discrete mathematics; Infimum and supremum; Monotone polygon; Monotonic function; Maximization; Algorithm; Mathematical optimization; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.00363244,0.002743233,0.003910481,0.001616988,0.001110106,0.003398825,0.005665815,0.002472003,0.0147241],"category_scores_gemma":[0.01474703,0.001314186,0.002188794,0.003081254,0.001695072,0.008291806,0.00409857,0.005138102,0.004688649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002524216,"about_ca_system_score_gemma":0.003295945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002400785,"about_ca_topic_score_gemma":0.003351457,"domain_scores_codex":[0.9961938,0.001352509,0.0001836961,0.0009940303,0.0007421465,0.0005338266],"domain_scores_gemma":[0.9929507,0.004345328,0.0003192044,0.001428026,0.0005659186,0.000390793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001960637,0.0009380863,0.001139312,0.0009394198,0.000262302,0.0002007539,0.0004013437,0.2162303,0.01026823,0.1620027,0.04842958,0.5572274],"study_design_scores_gemma":[0.0002451835,0.0002025385,0.0001426937,0.00004713597,0.00006297885,0.0001560768,0.00009209705,0.8745717,0.002349624,0.1179174,0.004171727,0.00004066523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01715441,0.001105933,0.9658512,0.001217533,0.0002759992,0.0002885017,0.0004450991,0.002876486,0.01078484],"genre_scores_gemma":[0.1311672,0.000364942,0.8610774,0.0006905321,0.0002782084,0.000462691,0.0007147679,0.0008766593,0.004367662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0147241,"threshold_uncertainty_score":0.04925704,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0218563223892489,"score_gpt":0.2614628641893752,"score_spread":0.2396065418001263,"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."}}