{"id":"https://openalex.org/W104626050","doi":"https://doi.org/10.1007/978-3-540-30538-5_29","title":"Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract","display_name":"Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W104626050","doi":"https://doi.org/10.1007/978-3-540-30538-5_29","mag":"104626050"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-30538-5_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30538-5_29","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/A5055839194","display_name":"Gerold J\u00e4ger","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Gerold J\u00e4ger","raw_affiliation_strings":["Mathematisches Seminar, Christian-Albrechts-Universit\u00e4t Kiel, Christian-Albrechts-Platz 4, D-24118, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Mathematisches Seminar, Christian-Albrechts-Universit\u00e4t Kiel, Christian-Albrechts-Platz 4, D-24118, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108463602","display_name":"Anand Srivastav","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Anand Srivastav","raw_affiliation_strings":["Mathematisches Seminar, Christian-Albrechts-Universit\u00e4t Kiel, Christian-Albrechts-Platz 4, D-24118, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Mathematisches Seminar, Christian-Albrechts-Universit\u00e4t Kiel, Christian-Albrechts-Platz 4, D-24118, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055839194"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5534,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65490082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"348","last_page":"359"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/hyperplane","display_name":"Hyperplane","score":0.6319124698638916},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.6012158393859863},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5505613684654236},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5236860513687134},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5208107233047485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5055689811706543},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.48076316714286804},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4755499064922333},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.4736924171447754},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4584801197052002},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45387402176856995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4411293566226959},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42870843410491943},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4024052023887634},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3810560405254364},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34627485275268555}],"concepts":[{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.6319124698638916},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6012158393859863},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5505613684654236},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5236860513687134},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5208107233047485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5055689811706543},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.48076316714286804},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4755499064922333},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.4736924171447754},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4584801197052002},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45387402176856995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4411293566226959},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42870843410491943},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4024052023887634},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3810560405254364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34627485275268555},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-30538-5_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-30538-5_29","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":[{"score":0.6100000143051147,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1498543354","https://openalex.org/W1512148653","https://openalex.org/W1552830247","https://openalex.org/W1596683029","https://openalex.org/W1601503375","https://openalex.org/W1985123706","https://openalex.org/W2010787744","https://openalex.org/W2019044741","https://openalex.org/W2032279394","https://openalex.org/W2032321507","https://openalex.org/W2034543148","https://openalex.org/W2036836182","https://openalex.org/W2043506441","https://openalex.org/W2046506015","https://openalex.org/W2047623182","https://openalex.org/W2079751294","https://openalex.org/W2143738202","https://openalex.org/W2171103562"],"related_works":["https://openalex.org/W2784134589","https://openalex.org/W2132400628","https://openalex.org/W579949368","https://openalex.org/W2952554274","https://openalex.org/W2023546589","https://openalex.org/W4250124835","https://openalex.org/W3178878483","https://openalex.org/W3000089047","https://openalex.org/W1985283864","https://openalex.org/W3110578096"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}