{"id":"https://openalex.org/W117968063","doi":"https://doi.org/10.1007/3-540-48686-0_28","title":"On the Complexity of Approximating Colored-Graph Problems Extended Abstract","display_name":"On the Complexity of Approximating Colored-Graph Problems Extended Abstract","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W117968063","doi":"https://doi.org/10.1007/3-540-48686-0_28","mag":"117968063"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-48686-0_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48686-0_28","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"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/A5001082357","display_name":"Andrea Clementi","orcid":"https://orcid.org/0000-0002-9521-2457"},"institutions":[{"id":"https://openalex.org/I116067653","display_name":"University of Rome Tor Vergata","ror":"https://ror.org/02p77k626","country_code":"IT","type":"education","lineage":["https://openalex.org/I116067653"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea E. F. Clementi","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma \u201cTor Vergata\u201d, Roma, Italy","Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma#TAB#"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma \u201cTor Vergata\u201d, Roma, Italy","institution_ids":["https://openalex.org/I116067653"]},{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 degli Studi di Roma#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012362492","display_name":"Pierluigi Crescenzi","orcid":"https://orcid.org/0000-0001-8789-3195"},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pierluigi Crescenzi","raw_affiliation_strings":["Dipartimento di Sistemi e Informatica, Universit\u00e0 degli Studi di Firenze, Firenze, Italy","Dipartimento di Sistemi e Informatica, Universita\u2019 degli studi di Firenze, Firenze, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Sistemi e Informatica, Universit\u00e0 degli Studi di Firenze, Firenze, Italy","institution_ids":["https://openalex.org/I45084792"]},{"raw_affiliation_string":"Dipartimento di Sistemi e Informatica, Universita\u2019 degli studi di Firenze, Firenze, Italy","institution_ids":["https://openalex.org/I45084792"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062564113","display_name":"Gianluca Del Rossi","orcid":"https://orcid.org/0000-0002-6440-8203"},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianluca Rossi","raw_affiliation_strings":["Dipartimento di Sistemi e Informatica, Universit\u00e0 degli Studi di Firenze, Firenze, Italy","Dipartimento di Sistemi e Informatica, Universita\u2019 degli studi di Firenze, Firenze, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Sistemi e Informatica, Universit\u00e0 degli Studi di Firenze, Firenze, Italy","institution_ids":["https://openalex.org/I45084792"]},{"raw_affiliation_string":"Dipartimento di Sistemi e Informatica, Universita\u2019 degli studi di Firenze, Firenze, Italy","institution_ids":["https://openalex.org/I45084792"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001082357"],"corresponding_institution_ids":["https://openalex.org/I116067653"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.0525687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"281","last_page":"290"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/colored","display_name":"Colored","score":0.7410765886306763},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.67540442943573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6017873883247375},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5637818574905396},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5629359483718872},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.49326008558273315},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4677845239639282},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42593562602996826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2952251732349396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26300302147865295},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2583014965057373}],"concepts":[{"id":"https://openalex.org/C2778307483","wikidata":"https://www.wikidata.org/wiki/Q5149038","display_name":"Colored","level":2,"score":0.7410765886306763},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.67540442943573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6017873883247375},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5637818574905396},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5629359483718872},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49326008558273315},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4677845239639282},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42593562602996826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2952251732349396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26300302147865295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2583014965057373},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-48686-0_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-48686-0_28","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.27.5825","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.5825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dsi.unifi.it/~rossig/Papers/COCOON1999/cocoon.ps","raw_type":"text"},{"id":"pmh:oai:flore.unifi.it:2158/237699","is_oa":false,"landing_page_url":"http://hdl.handle.net/2158/237699","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1488051549","https://openalex.org/W1501644705","https://openalex.org/W1539551091","https://openalex.org/W1566364654","https://openalex.org/W1566410171","https://openalex.org/W1656795039","https://openalex.org/W1967935161","https://openalex.org/W1985123706","https://openalex.org/W1987745187","https://openalex.org/W2011039300","https://openalex.org/W2030087828","https://openalex.org/W2036697377","https://openalex.org/W2038225707","https://openalex.org/W2041605864","https://openalex.org/W2055656009","https://openalex.org/W2069816168","https://openalex.org/W2077783414","https://openalex.org/W2081254453","https://openalex.org/W2087226760","https://openalex.org/W2089247135","https://openalex.org/W2097755092","https://openalex.org/W2104254886","https://openalex.org/W2117158270","https://openalex.org/W2126331452","https://openalex.org/W2148360835","https://openalex.org/W2153663865","https://openalex.org/W2172622297","https://openalex.org/W2499679874","https://openalex.org/W2502884183","https://openalex.org/W6601612977","https://openalex.org/W6611731895","https://openalex.org/W6811704845"],"related_works":["https://openalex.org/W2140509105","https://openalex.org/W3146178872","https://openalex.org/W4235907447","https://openalex.org/W4205128724","https://openalex.org/W2040849466","https://openalex.org/W346008744","https://openalex.org/W2072835713","https://openalex.org/W1966261337","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}