{"id":"W2953175718","doi":"10.48550/arxiv.1409.6952","title":"A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Vertex cover; Bipartite graph; Combinatorics; Bounded function; Cover (algebra); Greedy algorithm; Vertex (graph theory); Mathematics; Approximation algorithm; Combinatorial algorithms; Discrete mathematics; Algorithm; Graph","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.00248946,0.00172368,0.001397604,0.001471832,0.001179618,0.003113611,0.004484683,0.002586557,0.009096932],"category_scores_gemma":[0.01430465,0.0007692541,0.001480202,0.002396536,0.001516679,0.004923071,0.002727515,0.002651762,0.003224307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002694921,"about_ca_system_score_gemma":0.002698855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001329406,"about_ca_topic_score_gemma":0.00232186,"domain_scores_codex":[0.9970041,0.00104618,0.000154444,0.0005302276,0.0008773074,0.0003877926],"domain_scores_gemma":[0.9931005,0.004475114,0.0004395286,0.001418215,0.0003202461,0.0002462895],"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.00297045,0.001453522,0.003857993,0.001099538,0.00025086,0.0003120388,0.0003462903,0.3100449,0.04447569,0.1362959,0.02973058,0.4691622],"study_design_scores_gemma":[0.0003653919,0.0004511499,0.001097783,0.00005228801,0.00008495216,0.0005083628,0.00008396099,0.8968477,0.01098114,0.08439428,0.005064278,0.00006870915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07397202,0.0008243227,0.8960472,0.001415169,0.0002049607,0.0003793731,0.0004340931,0.005546002,0.02117686],"genre_scores_gemma":[0.3654443,0.0003502729,0.6252326,0.0005971159,0.0002279002,0.0005199829,0.001083902,0.0007350894,0.005808881],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009096932,"threshold_uncertainty_score":0.03043222,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05102069242716498,"score_gpt":0.2224863825584419,"score_spread":0.171465690131277,"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."}}