{"doi":"10.1145/306198.306210","title":"How to find the best approximation results","abstract":"<jats:p>A compendium of NP optimization problems, containing the best approximation results known for each problem, is available on the world wide web at http://www.nada.kth.se/~viggo/problemlist/In this paper we describe the compendium, and specify how the compendium is consultable as well as modifiable on the web. We also give statistics for the use of the compendium.</jats:p>","journal":"ACM SIGACT News","year":1998,"id":13816,"datarank":1.6436195525277286,"base_score":3.4965075614664802,"endowment":3.4965075614664802,"self_citation_contribution":0.5244761342199721,"citation_network_contribution":1.1191434183077564,"self_endowment_contribution":0.5244761342199721,"citer_contribution":1.1191434183077564,"corpus_percentile":87.32884660013924,"corpus_rank":1639,"citation_count":32,"citer_count":32,"citers_with_citation_signal":21,"citers_with_endowment":21,"datacite_reuse_total":0,"is_dataset":true,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":111775,"name":"Viggo Kann","orcid":null,"position":1,"is_corresponding":false},{"id":111774,"name":"Pierluigi Crescenzi","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":3.4965075614664802,"endowment":3.4965075614664802,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18940862","pmcid":null,"openalex_id":"https://openalex.org/W2088998312","authors":[],"funders":[],"total_grants":0,"fwci":1.0199,"citation_percentile":0.77756505,"influential_citations":0,"citation_trend":[{"year":2012,"count":1},{"year":2014,"count":1},{"year":2018,"count":1}],"oa_status":"bronze","license":"https://www.acm.org/publications/policies/copyright_policy#Background","oa_locations":[{"url":"https://dl.acm.org/doi/pdf/10.1145/306198.306210","host_type":"journal"},{"url":"https://dl.acm.org/doi/pdf/10.1145/306198.306210","host_type":"BRONZE"},{"url":"https://dl.acm.org/doi/pdf/10.1145/306198.306210","host_type":"publisher"},{"url":"https://dl.acm.org/doi/10.1145/306198.306210","host_type":"publisher"},{"url":"https://doi.org/10.1145/306198.306210","host_type":"journal"}],"fields_of_study":["Complexity and Algorithms in Graphs","Advanced Graph Theory Research","Computational Geometry and Mesh Generation","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Compendium","Computer science","Information retrieval","World Wide Web","Geography"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Partnerships for the goals"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-05-31T17:59:12.567017Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}