{"id":"https://openalex.org/W1709205181","doi":"https://doi.org/10.1007/978-3-662-48350-3_58","title":"Approximation Algorithms for Connected Maximum Cut and Related Problems","display_name":"Approximation Algorithms for Connected Maximum Cut and Related Problems","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1709205181","doi":"https://doi.org/10.1007/978-3-662-48350-3_58","mag":"1709205181"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-48350-3_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-48350-3_58","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":"conference-paper","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/A5084358000","display_name":"Mohammad Taghi Hajiaghayi","orcid":"https://orcid.org/0000-0003-4842-0533"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Taghi Hajiaghayi","raw_affiliation_strings":["University of Maryland, College Park, MD, 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":["Rutgers University - Camden, Camden, NJ, 08102, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University - Camden, Camden, NJ, 08102, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030203436","display_name":"Robert MacDavid","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert MacDavid","raw_affiliation_strings":["Rutgers University - Camden, Camden, NJ, 08102, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University - Camden, Camden, NJ, 08102, USA","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054974601","display_name":"Manish Purohit","orcid":"https://orcid.org/0000-0002-8650-2022"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manish Purohit","raw_affiliation_strings":["University of Maryland, College Park, MD, 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047410299","display_name":"Kanthi Sarpatwar","orcid":"https://orcid.org/0000-0002-7737-1200"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kanthi Sarpatwar","raw_affiliation_strings":["IBM T. J. Watson Research Center, Yorktown Heights, NY, 10598, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights, NY, 10598, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"693","last_page":"704"},"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.9994999766349792,"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.9994999766349792,"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.9951000213623047,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6743464469909668},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6647473573684692},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6584548354148865},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6077536344528198},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5555131435394287},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5548056960105896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.527374267578125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44477060437202454},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44159871339797974},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4219379127025604},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40473100543022156},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3546011447906494},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29299497604370117}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6743464469909668},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6647473573684692},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6584548354148865},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6077536344528198},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5555131435394287},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5548056960105896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.527374267578125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44477060437202454},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44159871339797974},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4219379127025604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40473100543022156},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3546011447906494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29299497604370117},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","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":1,"locations":[{"id":"doi:10.1007/978-3-662-48350-3_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-48350-3_58","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W89448923","https://openalex.org/W143512583","https://openalex.org/W564518845","https://openalex.org/W1484268536","https://openalex.org/W1588283647","https://openalex.org/W1680189815","https://openalex.org/W1695878779","https://openalex.org/W1728611673","https://openalex.org/W1985123706","https://openalex.org/W1988652875","https://openalex.org/W1998608896","https://openalex.org/W1999478155","https://openalex.org/W2002722727","https://openalex.org/W2049184889","https://openalex.org/W2053381548","https://openalex.org/W2073705438","https://openalex.org/W2082353536","https://openalex.org/W2087038607","https://openalex.org/W2097277086","https://openalex.org/W2098502330","https://openalex.org/W2129866531","https://openalex.org/W2147879413","https://openalex.org/W2147899407","https://openalex.org/W2150593780","https://openalex.org/W2158557760","https://openalex.org/W2165926628","https://openalex.org/W2169528477","https://openalex.org/W2169848785","https://openalex.org/W2252172643","https://openalex.org/W2261119684","https://openalex.org/W2263717697","https://openalex.org/W2295428206","https://openalex.org/W2621717961","https://openalex.org/W2949074253","https://openalex.org/W2963482969","https://openalex.org/W2963654823","https://openalex.org/W3141863997","https://openalex.org/W4231490457","https://openalex.org/W4231916799","https://openalex.org/W4246355065","https://openalex.org/W4251076636"],"related_works":["https://openalex.org/W4289237035","https://openalex.org/W2905360057","https://openalex.org/W3109770881","https://openalex.org/W2906860838","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2040444410","https://openalex.org/W2037387767","https://openalex.org/W2745252358"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}