{"id":"W2105659243","doi":"10.1007/978-3-642-31594-7_13","title":"Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Matroid; Submodular set function; Set function; Rank (graph theory); Maximization; Matroid partitioning; Combinatorics; Function (biology); Set (abstract data type); Weighted matroid; Computer science; Mathematics; Online algorithm; Competitive analysis; Constraint (computer-aided design); Discrete mathematics; Mathematical optimization; Algorithm; Graphic matroid; Upper and lower bounds","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.004554179,0.003960079,0.004905268,0.002320101,0.001183659,0.005233541,0.008278825,0.004991296,0.01537438],"category_scores_gemma":[0.01934281,0.002274323,0.002507902,0.00685256,0.0019739,0.01012,0.004689083,0.006991198,0.005161089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00366877,"about_ca_system_score_gemma":0.0036205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004987705,"about_ca_topic_score_gemma":0.007784719,"domain_scores_codex":[0.9962303,0.00125434,0.0001973819,0.0008131423,0.000947823,0.0005569709],"domain_scores_gemma":[0.9905003,0.006199713,0.0006046208,0.001475072,0.0008292312,0.0003909949],"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.0007068914,0.000826979,0.0008046953,0.0007453164,0.0001965029,0.0001334915,0.0002477101,0.5249614,0.001997122,0.09199373,0.030819,0.3465673],"study_design_scores_gemma":[0.00008350495,0.000040396,0.00007334503,0.00002889663,0.00002994178,0.00004967489,0.0000338302,0.9354361,0.0004257323,0.0626828,0.001101122,0.00001470179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006215808,0.0008819049,0.9864352,0.0005223479,0.0001269304,0.0001542867,0.0003657735,0.001380125,0.003917536],"genre_scores_gemma":[0.1314936,0.001066405,0.8538486,0.0004930315,0.0004997028,0.000849307,0.001816577,0.001016075,0.008916714],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01537438,"threshold_uncertainty_score":0.05143237,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03343926846114101,"score_gpt":0.2580674556177863,"score_spread":0.2246281871566453,"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."}}