{"id":"https://openalex.org/W1568947763","doi":"https://doi.org/10.1007/3-540-44436-x_5","title":"An Approximation Algorithm for MAX DICUT with Given Sizes of Parts","display_name":"An Approximation Algorithm for MAX DICUT with Given Sizes of Parts","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1568947763","doi":"https://doi.org/10.1007/3-540-44436-x_5","mag":"1568947763"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44436-x_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44436-x_5","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/A5064729884","display_name":"Alexander Ageev","orcid":"https://orcid.org/0000-0002-3369-9650"},"institutions":[{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Alexander Ageev","raw_affiliation_strings":["Sobolev Institute of Mathematics, pr. Koptyuga 4, 630090, Novosibirsk, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sobolev Institute of Mathematics, pr. Koptyuga 4, 630090, Novosibirsk, Russia","institution_ids":["https://openalex.org/I4210096862"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022008503","display_name":"Refael Hassin","orcid":"https://orcid.org/0000-0001-9631-6162"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Refael Hassin","raw_affiliation_strings":["School of Mathematical Sciences, Tel Aviv University, Tel Aviv, 69978, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Tel Aviv University, Tel Aviv, 69978, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111449864","display_name":"Maxim Sviridenko","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Maxim Sviridenko","raw_affiliation_strings":["BRICS University of Aarhus, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"BRICS University of Aarhus, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"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":"34","last_page":"41"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.994700014591217,"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/rounding","display_name":"Rounding","score":0.92356276512146},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6905599236488342},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5776347517967224},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5445256233215332},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5312181711196899},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5097712874412537},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4962387681007385},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4881921410560608},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4871320426464081},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.47965267300605774},{"id":"https://openalex.org/keywords/weight-function","display_name":"Weight function","score":0.4769526720046997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4765932261943817},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4714537560939789},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44672900438308716},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.412923127412796},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4111528992652893},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3724479377269745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2607433795928955}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.92356276512146},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6905599236488342},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5776347517967224},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5445256233215332},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5312181711196899},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5097712874412537},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4962387681007385},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4881921410560608},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4871320426464081},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.47965267300605774},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.4769526720046997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4765932261943817},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4714537560939789},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44672900438308716},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.412923127412796},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4111528992652893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3724479377269745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2607433795928955},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-44436-x_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44436-x_5","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.20.8795","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8795","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~hassin/dicut.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.3519","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.3519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://math.nsc.ru/LBRT/k5/Ageev/maxdicut.ps","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":7,"referenced_works":["https://openalex.org/W1512148653","https://openalex.org/W1527271318","https://openalex.org/W1577487475","https://openalex.org/W1985123706","https://openalex.org/W2034543148","https://openalex.org/W2109039359","https://openalex.org/W2153014861"],"related_works":["https://openalex.org/W2132400628","https://openalex.org/W579949368","https://openalex.org/W2952554274","https://openalex.org/W3178878483","https://openalex.org/W2920857515","https://openalex.org/W2141353198","https://openalex.org/W3000089047","https://openalex.org/W1985283864","https://openalex.org/W3110578096","https://openalex.org/W2096411231"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"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"}