{"id":"https://openalex.org/W164187068","doi":"https://doi.org/10.1007/978-3-642-19094-0_8","title":"Inapproximability of b-Matching in k-Uniform Hypergraphs","display_name":"Inapproximability of b-Matching in k-Uniform Hypergraphs","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W164187068","doi":"https://doi.org/10.1007/978-3-642-19094-0_8","mag":"164187068"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-19094-0_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19094-0_8","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/A5057847653","display_name":"Mourad El Ouali","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":"Mourad El Ouali","raw_affiliation_strings":["Department of Computer Science, University of Kiel, Christian-Albrechts-Platz 4, D-24098, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kiel, Christian-Albrechts-Platz 4, D-24098, Germany","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078942568","display_name":"Antje Fretwurst","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":"Antje Fretwurst","raw_affiliation_strings":["Department of Computer Science, University of Kiel, Christian-Albrechts-Platz 4, D-24098, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kiel, Christian-Albrechts-Platz 4, D-24098, 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":["Department of Computer Science, University of Kiel, Christian-Albrechts-Platz 4, D-24098, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Kiel, Christian-Albrechts-Platz 4, D-24098, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057847653"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3891,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61078431,"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":"57","last_page":"69"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9976999759674072,"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/combinatorics","display_name":"Combinatorics","score":0.8781751394271851},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.840213418006897},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6134082078933716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6018067598342896},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5715218782424927},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5671609044075012},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5399754643440247},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5172432065010071},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5067384839057922},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.49466463923454285},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.46686267852783203},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.415474534034729},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37495654821395874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.24959692358970642},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.15860441327095032},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07703444361686707}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8781751394271851},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.840213418006897},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6134082078933716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6018067598342896},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5715218782424927},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5671609044075012},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5399754643440247},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5172432065010071},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5067384839057922},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.49466463923454285},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.46686267852783203},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.415474534034729},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37495654821395874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.24959692358970642},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.15860441327095032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07703444361686707},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-19094-0_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-19094-0_8","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":26,"referenced_works":["https://openalex.org/W1571333131","https://openalex.org/W1589421353","https://openalex.org/W1601836823","https://openalex.org/W1859357731","https://openalex.org/W1966815789","https://openalex.org/W1966923282","https://openalex.org/W1970411956","https://openalex.org/W1976103322","https://openalex.org/W1993119087","https://openalex.org/W1999032440","https://openalex.org/W2001663593","https://openalex.org/W2019578639","https://openalex.org/W2022191808","https://openalex.org/W2035532007","https://openalex.org/W2050272710","https://openalex.org/W2066356146","https://openalex.org/W2077783414","https://openalex.org/W2079192114","https://openalex.org/W2108515073","https://openalex.org/W2110009764","https://openalex.org/W2140118062","https://openalex.org/W2148352980","https://openalex.org/W2163322487","https://openalex.org/W2401610261","https://openalex.org/W2494705596","https://openalex.org/W4244456148"],"related_works":["https://openalex.org/W2962917430","https://openalex.org/W4299801389","https://openalex.org/W2131810278","https://openalex.org/W2574604093","https://openalex.org/W2307719096","https://openalex.org/W1561811279","https://openalex.org/W1496354680","https://openalex.org/W2963411648","https://openalex.org/W2952838392","https://openalex.org/W2115404728"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}