{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009366471,0.0005914379,0.0005493391,0.001006178,0.0004351459,0.0004920551,0.00186077,0.000357814,0.00005809529],"category_scores_gemma":[0.00004734509,0.000571996,0.0002166237,0.0007415003,0.0008801202,0.001099693,0.000594809,0.000622872,0.00002397388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000301355,"about_ca_system_score_gemma":0.0003367013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008744444,"about_ca_topic_score_gemma":0.00002978328,"domain_scores_codex":[0.9961887,0.00004582979,0.0006887782,0.001377334,0.0009234636,0.0007759013],"domain_scores_gemma":[0.997366,0.0004571764,0.0004471838,0.001062495,0.0004710565,0.0001961228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000126312,0.00007386937,0.000006912565,0.00005304578,0.00002094068,0.000002770533,0.0001581611,0.006719782,0.00006824018,0.1084648,0.00001702123,0.8844019],"study_design_scores_gemma":[0.0004781167,0.0001172187,0.0001165356,0.0001391269,0.00001999269,0.00004351202,3.098612e-7,0.6124345,0.0002508396,0.3849531,0.0009658784,0.0004808457],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002655069,0.0005564275,0.9935787,0.0007115085,0.003389758,0.0009747,0.00005080877,0.0002937023,0.0004177917],"genre_scores_gemma":[0.01507235,0.00006504179,0.9821472,0.001192754,0.001120521,0.00003213103,0.0001820933,0.00004713871,0.0001408199],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.883921,"threshold_uncertainty_score":0.9996731,"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."}}