{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001312477,0.0002336713,0.0002525166,0.000336671,0.0006950004,0.0007112189,0.00111938,0.00007723595,0.000006969919],"category_scores_gemma":[0.0002106309,0.0002066941,0.00007556373,0.001757074,0.001349153,0.0009982556,0.0007371073,0.0001944509,0.0000244372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008162245,"about_ca_system_score_gemma":0.00007426095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003315124,"about_ca_topic_score_gemma":7.905118e-7,"domain_scores_codex":[0.9975232,0.0001054,0.0002937361,0.0009031079,0.0006304947,0.0005440694],"domain_scores_gemma":[0.9980291,0.0007800116,0.0001023202,0.0006316432,0.0002513865,0.0002055407],"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.000006453038,0.00009273288,0.000008763367,0.00001492141,0.000005078051,0.000002359148,0.0007669121,0.0003544744,0.0006518798,0.703361,0.00002703089,0.2947083],"study_design_scores_gemma":[0.0002629394,0.0002924964,0.0007509419,0.00002234361,0.000003564876,0.000005410014,0.000008308043,0.727645,0.00953648,0.2612404,0.00003921234,0.0001929516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03682978,0.000004653482,0.9603446,0.001078069,0.0005416049,0.0005876233,0.00001529739,0.0003152251,0.0002832179],"genre_scores_gemma":[0.5785441,0.000003070734,0.4209795,0.0003128042,0.0000955718,0.00003709921,0.000006092095,0.00000973806,0.00001209359],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7272905,"threshold_uncertainty_score":0.8428742,"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."}}