{"id":"https://openalex.org/W1595088992","doi":"https://doi.org/10.1007/978-3-642-22935-0_24","title":"Approximation Schemes for the Betweenness\u00a0Problem in Tournaments and Related Ranking Problems","display_name":"Approximation Schemes for the Betweenness\u00a0Problem in Tournaments and Related Ranking Problems","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1595088992","doi":"https://doi.org/10.1007/978-3-642-22935-0_24","mag":"1595088992"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-22935-0_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22935-0_24","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/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Marek Karpinski","raw_affiliation_strings":["Dept. of Computer Science, University of Bonn, Germany"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079220724","display_name":"Warren Schudy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Warren Schudy","raw_affiliation_strings":["IBM T.J. Watson Research Center, USA"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108090276"],"corresponding_institution_ids":["https://openalex.org/I135140700"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":12.9308,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.98338794,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"277","last_page":"288"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9894000291824341,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9890999794006348,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/betweenness-centrality","display_name":"Betweenness centrality","score":0.8443299531936646},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.7771968245506287},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.7328168749809265},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6196378469467163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6129395365715027},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5229083895683289},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.49601730704307556},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4638720750808716},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4507276713848114},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39846861362457275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2983817458152771},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2803635001182556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22570380568504333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20011737942695618}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.8443299531936646},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.7771968245506287},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.7328168749809265},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6196378469467163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6129395365715027},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5229083895683289},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.49601730704307556},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4638720750808716},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4507276713848114},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39846861362457275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2983817458152771},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2803635001182556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22570380568504333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20011737942695618},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-22935-0_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22935-0_24","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":27,"referenced_works":["https://openalex.org/W61748014","https://openalex.org/W1964678328","https://openalex.org/W1973652906","https://openalex.org/W1976779334","https://openalex.org/W1986978101","https://openalex.org/W1998058722","https://openalex.org/W1999657075","https://openalex.org/W2001866149","https://openalex.org/W2010471713","https://openalex.org/W2016963000","https://openalex.org/W2023414599","https://openalex.org/W2027048490","https://openalex.org/W2056590617","https://openalex.org/W2060990051","https://openalex.org/W2065641139","https://openalex.org/W2066979869","https://openalex.org/W2072858942","https://openalex.org/W2074844420","https://openalex.org/W2091858563","https://openalex.org/W2095940121","https://openalex.org/W2097684808","https://openalex.org/W2117654132","https://openalex.org/W2124900884","https://openalex.org/W2129869029","https://openalex.org/W2140971199","https://openalex.org/W2287816539","https://openalex.org/W2912532202"],"related_works":["https://openalex.org/W2728054344","https://openalex.org/W2284958355","https://openalex.org/W4301487118","https://openalex.org/W2950077880","https://openalex.org/W3164090850","https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2048358792","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}