{"id":"https://openalex.org/W1495609670","doi":"https://doi.org/10.1007/3-540-63774-5_137","title":"Approximation algorithms for the vertex bipartization problem","display_name":"Approximation algorithms for the vertex bipartization problem","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W1495609670","doi":"https://doi.org/10.1007/3-540-63774-5_137","mag":"1495609670"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-63774-5_137","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-63774-5_137","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/A5113449944","display_name":"H. Schr\u00f6der","orcid":null},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"H. Schr\u00f6der","raw_affiliation_strings":["P\u00c5RC, Loughborough University, Loughborough, UK","Loughborough University ,"],"affiliations":[{"raw_affiliation_string":"P\u00c5RC, Loughborough University, Loughborough, UK","institution_ids":["https://openalex.org/I143804889"]},{"raw_affiliation_string":"Loughborough University ,","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079246837","display_name":"Adam May","orcid":null},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A.E. May","raw_affiliation_strings":["P\u00c5RC, Loughborough University, Loughborough, UK","Loughborough University ,"],"affiliations":[{"raw_affiliation_string":"P\u00c5RC, Loughborough University, Loughborough, UK","institution_ids":["https://openalex.org/I143804889"]},{"raw_affiliation_string":"Loughborough University ,","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063290861","display_name":"Imrich Vrt\u2019o","orcid":null},"institutions":[{"id":"https://openalex.org/I207624831","display_name":"Slovak Academy of Sciences","ror":"https://ror.org/03h7qq074","country_code":"SK","type":"funder","lineage":["https://openalex.org/I207624831"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"I. Vrt'o","raw_affiliation_strings":["Institute for Informatics, Slovak Academy of Sciences, Bratislava","Slovak Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"Institute for Informatics, Slovak Academy of Sciences, Bratislava","institution_ids":["https://openalex.org/I207624831"]},{"raw_affiliation_string":"Slovak Academy of Sciences","institution_ids":["https://openalex.org/I207624831"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073592264","display_name":"Ond\u0159ej S\u00fdkora","orcid":null},"institutions":[{"id":"https://openalex.org/I207624831","display_name":"Slovak Academy of Sciences","ror":"https://ror.org/03h7qq074","country_code":"SK","type":"funder","lineage":["https://openalex.org/I207624831"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"O. S\u00fdkora","raw_affiliation_strings":["Institute for Informatics, Slovak Academy of Sciences, Bratislava","Slovak Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"Institute for Informatics, Slovak Academy of Sciences, Bratislava","institution_ids":["https://openalex.org/I207624831"]},{"raw_affiliation_string":"Slovak Academy of Sciences","institution_ids":["https://openalex.org/I207624831"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5113449944"],"corresponding_institution_ids":["https://openalex.org/I143804889"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.13294347,"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":"547","last_page":"554"},"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.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.9979000091552734,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8403928279876709},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6421116590499878},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.5757832527160645},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5614979863166809},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5247963666915894},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5016775131225586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4631957411766052},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4487072229385376},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43532121181488037},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.42385995388031006},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38008415699005127},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3782922029495239},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36077165603637695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35612645745277405},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.11460772156715393},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10504314303398132}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8403928279876709},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6421116590499878},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.5757832527160645},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5614979863166809},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5247963666915894},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5016775131225586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4631957411766052},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4487072229385376},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43532121181488037},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.42385995388031006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38008415699005127},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3782922029495239},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36077165603637695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35612645745277405},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11460772156715393},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10504314303398132}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-63774-5_137","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-63774-5_137","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2073705438","https://openalex.org/W2080905757","https://openalex.org/W2086917808","https://openalex.org/W2097277086","https://openalex.org/W2917997019","https://openalex.org/W4214936872"],"related_works":["https://openalex.org/W2018072810","https://openalex.org/W4246619488","https://openalex.org/W2943731653","https://openalex.org/W4288361500","https://openalex.org/W175379075","https://openalex.org/W2974375505","https://openalex.org/W2109969113","https://openalex.org/W3003357078","https://openalex.org/W136172668","https://openalex.org/W1495609670"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}