{"id":"W7133027849","doi":"","title":"Approximate truthful mechanisms for the knapsack problem, and negative results using a stack model for local ratio algorithms","year":2005,"lang":"","type":"dissertation","venue":"TSpace","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Library and Archives Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Approximation algorithm; Polynomial-time approximation scheme; Set (abstract data type); Stack (abstract data type); Set cover problem; Bandwidth (computing); Tree (set theory); Facility location problem","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01212621,0.001762343,0.001653614,0.002235162,0.001759773,0.005635642,0.003821752,0.002961204,0.005355155],"category_scores_gemma":[0.04533625,0.0009602728,0.002959884,0.002862032,0.006729899,0.01868643,0.003715202,0.007771699,0.0007194706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005144829,"about_ca_system_score_gemma":0.002608937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002066535,"about_ca_topic_score_gemma":0.001156683,"domain_scores_codex":[0.9934081,0.003173112,0.00030118,0.0007644765,0.001799434,0.0005537657],"domain_scores_gemma":[0.9647772,0.02732507,0.001902745,0.003742458,0.001664425,0.0005881143],"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.0001231545,0.00006656502,0.0002446173,0.0001428711,0.00003673546,0.00004173354,0.0001552804,0.04654473,0.000525641,0.9365339,0.001631979,0.01395276],"study_design_scores_gemma":[0.00003439761,0.00007531789,0.0001012833,0.00005731085,0.00003808914,0.00006241418,0.00005796049,0.1552596,0.0006092787,0.8410465,0.002632832,0.00002497671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02835513,0.003742368,0.9440984,0.005185197,0.0002444495,0.00007773676,0.00009017725,0.0002826265,0.01792399],"genre_scores_gemma":[0.7385829,0.006201935,0.2371461,0.001615751,0.001067172,0.000532236,0.0002613454,0.0003335131,0.01425904],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01212621,"threshold_uncertainty_score":0.06413031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07379328664914889,"score_gpt":0.3665379199693105,"score_spread":0.2927446333201615,"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."}}