{"id":"https://openalex.org/W2313195058","doi":null,"title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Combinatorial ... (Lecture Notes in Computer Science)","display_name":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 9th International Workshop on Approximation Algorithms for Combinatorial ... (Lecture Notes in Computer Science)","publication_year":2006,"publication_date":"2006-09-01","ids":{"openalex":"https://openalex.org/W2313195058","mag":"2313195058"},"language":"en","primary_location":{"id":"mag:2313195058","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1208264","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Springer eBooks","raw_type":null},"volume":null,"type":"book","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037690759","display_name":"Josep D\u00edaz","orcid":"https://orcid.org/0000-0003-4422-0067","observed_orcids":["https://orcid.org/0000-0003-4422-0067"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Josep D\u0131\u0301az","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4422-0067","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071305115","display_name":"Klaus Jansen","orcid":"https://orcid.org/0000-0001-8358-6796","observed_orcids":["https://orcid.org/0000-0001-8358-6796"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klaus Jansen","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8358-6796","affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Andrea Roli","orcid":"https://orcid.org/0000-0001-9891-5441","observed_orcids":["https://orcid.org/0000-0001-9891-5441"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrea Roli","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-9891-5441","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710","observed_orcids":["https://orcid.org/0000-0002-7638-7710"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uri Zwick","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-7638-7710","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9980000257492065},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.7929999828338623},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.890999972820282}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6044855713844299},{"id":"https://openalex.org/C204243189","wikidata":"https://www.wikidata.org/wiki/Q1363085","display_name":"Randomization","level":3,"score":0.5260241627693176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5224632024765015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3439463973045349},{"id":"https://openalex.org/C60644358","wikidata":"https://www.wikidata.org/wiki/Q128570","display_name":"Bioinformatics","level":1,"score":0.13815221190452576},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.052529871463775635},{"id":"https://openalex.org/C535046627","wikidata":"https://www.wikidata.org/wiki/Q30612","display_name":"Clinical trial","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2313195058","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1208264","pdf_url":null,"source":{"id":"https://openalex.org/S4306463937","display_name":"Springer eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Springer eBooks","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1583029264","https://openalex.org/W2513932935","https://openalex.org/W4297581620","https://openalex.org/W1982071374","https://openalex.org/W2080197044","https://openalex.org/W1969527859","https://openalex.org/W2038380611","https://openalex.org/W2493572475","https://openalex.org/W2039130930","https://openalex.org/W6980006637"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}