{"id":"https://openalex.org/W2748900204","doi":"https://doi.org/10.1007/s00453-017-0362-9","title":"Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs","display_name":"Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs","publication_year":2017,"publication_date":"2017-08-17","ids":{"openalex":"https://openalex.org/W2748900204","doi":"https://doi.org/10.1007/s00453-017-0362-9","mag":"2748900204"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-017-0362-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-017-0362-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","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/A5084121765","display_name":"Tim Nonner","orcid":"https://orcid.org/0000-0001-7638-5689"},"institutions":[{"id":"https://openalex.org/I4210126328","display_name":"IBM Research - Zurich","ror":"https://ror.org/02js37d36","country_code":"CH","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210126328"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Tim Nonner","raw_affiliation_strings":["IBM Research, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"IBM Research, Zurich, Switzerland","institution_ids":["https://openalex.org/I4210126328"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084121765"],"corresponding_institution_ids":["https://openalex.org/I4210126328"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14654331,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"80","issue":"10","first_page":"2941","last_page":"2956"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.754420280456543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7285942435264587},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6188234090805054},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.6101547479629517},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6048425436019897},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5533895492553711},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5333395600318909},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.526317834854126},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5055692195892334},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.46974045038223267},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.4496760666370392},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4365634024143219},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.40202295780181885},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3911654055118561},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.15548530220985413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1266758143901825},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0730387270450592}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.754420280456543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7285942435264587},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6188234090805054},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6101547479629517},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6048425436019897},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5533895492553711},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5333395600318909},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.526317834854126},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5055692195892334},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.46974045038223267},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.4496760666370392},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4365634024143219},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.40202295780181885},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3911654055118561},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.15548530220985413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1266758143901825},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0730387270450592},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"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":2,"locations":[{"id":"doi:10.1007/s00453-017-0362-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-017-0362-9","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.370.2308","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.370.2308","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nonner.de/homepage/papers/maxcoloring.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1498089635","https://openalex.org/W1542595106","https://openalex.org/W1972620016","https://openalex.org/W2004394201","https://openalex.org/W2023853306","https://openalex.org/W2026891055","https://openalex.org/W2029120932","https://openalex.org/W2058422149","https://openalex.org/W2062918232","https://openalex.org/W2069417991","https://openalex.org/W2093532287","https://openalex.org/W2100440346","https://openalex.org/W2100961486","https://openalex.org/W2103286310","https://openalex.org/W2130766066","https://openalex.org/W2154135432","https://openalex.org/W2156187051","https://openalex.org/W2160543991","https://openalex.org/W2163111788","https://openalex.org/W2165142526","https://openalex.org/W2186826687","https://openalex.org/W4236064384"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4291316360","https://openalex.org/W3169197204","https://openalex.org/W1542397451","https://openalex.org/W4229747356","https://openalex.org/W2380525562","https://openalex.org/W4297911588","https://openalex.org/W2385428710","https://openalex.org/W2585997002","https://openalex.org/W2111880533"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}