{"id":"W1575996043","doi":"10.1007/978-3-540-77120-3_28","title":"Approximability of Packing Disjoint Cycles","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Disjoint sets; Packing problems; Mathematics; Undirected graph; Binary logarithm; Upper and lower bounds; Omega; Vertex (graph theory); Approximation algorithm; Graph; Log-log plot; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Physics","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.001048166,0.001434548,0.001681881,0.001396522,0.0008556087,0.00323001,0.003120232,0.001411539,0.01077762],"category_scores_gemma":[0.01005322,0.001106604,0.002257738,0.00272688,0.001776457,0.006095337,0.002923191,0.004166351,0.001149556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002521987,"about_ca_system_score_gemma":0.0008846957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002433679,"about_ca_topic_score_gemma":0.002000981,"domain_scores_codex":[0.9985359,0.0002738822,0.00008491913,0.0003431535,0.0005619233,0.0002002277],"domain_scores_gemma":[0.9950872,0.003282801,0.0002027849,0.001005635,0.0002674352,0.0001542939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005440888,0.0001964335,0.001032926,0.0008001845,0.0001211704,0.0001877054,0.0005921764,0.1944033,0.005116321,0.5944208,0.01203284,0.1905522],"study_design_scores_gemma":[0.00005213787,0.000049372,0.0003321698,0.00008683826,0.00006410707,0.0002034783,0.00007958245,0.2261967,0.002474394,0.7621113,0.008331803,0.00001810963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1728827,0.003642654,0.7236992,0.001312488,0.0003846967,0.0001907802,0.0007933901,0.001864668,0.0952296],"genre_scores_gemma":[0.6839581,0.003363496,0.2768984,0.0004221766,0.0004483015,0.0003683796,0.002278501,0.001089131,0.03117342],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01077762,"threshold_uncertainty_score":0.03605473,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02392553823466615,"score_gpt":0.2429250520518188,"score_spread":0.2189995138171527,"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."}}