{"id":"https://openalex.org/W2536885665","doi":"https://doi.org/10.1007/978-3-319-51741-4_14","title":"Tight Approximation Bounds for the Seminar Assignment Problem","display_name":"Tight Approximation Bounds for the Seminar Assignment Problem","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2536885665","doi":"https://doi.org/10.1007/978-3-319-51741-4_14","mag":"2536885665"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-51741-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-51741-4_14","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/A5050059210","display_name":"Amotz Bar-Noy","orcid":"https://orcid.org/0009-0004-7021-9072"},"institutions":[{"id":"https://openalex.org/I121847817","display_name":"The Graduate Center, CUNY","ror":"https://ror.org/00awd9g61","country_code":"US","type":"education","lineage":["https://openalex.org/I121847817"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amotz Bar-Noy","raw_affiliation_strings":["Department of Computer Science, Graduate Center, CUNY, New York City, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Graduate Center, CUNY, New York City, USA","institution_ids":["https://openalex.org/I121847817"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015459695","display_name":"George Rabanca","orcid":null},"institutions":[{"id":"https://openalex.org/I121847817","display_name":"The Graduate Center, CUNY","ror":"https://ror.org/00awd9g61","country_code":"US","type":"education","lineage":["https://openalex.org/I121847817"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George Rabanca","raw_affiliation_strings":["Department of Computer Science, Graduate Center, CUNY, New York City, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Graduate Center, CUNY, New York City, USA","institution_ids":["https://openalex.org/I121847817"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050059210"],"corresponding_institution_ids":["https://openalex.org/I121847817"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.068,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.72879104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"170","last_page":"182"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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.9991000294685364,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7152963876724243},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5803606510162354},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5719545483589172},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.5511783361434937},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5012884140014648},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5010800361633301},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.496872216463089},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.49252089858055115},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.48979687690734863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4640952944755554},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.4375101625919342},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43185558915138245},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4299638569355011},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4259990453720093},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4253835380077362},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4169030487537384},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.374087929725647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3326232433319092},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.09066781401634216},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.06088733673095703}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7152963876724243},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5803606510162354},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5719545483589172},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5511783361434937},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5012884140014648},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5010800361633301},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.496872216463089},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.49252089858055115},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.48979687690734863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4640952944755554},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.4375101625919342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43185558915138245},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4299638569355011},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4259990453720093},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4253835380077362},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4169030487537384},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.374087929725647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3326232433319092},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.09066781401634216},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.06088733673095703},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-51741-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-51741-4_14","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":14,"referenced_works":["https://openalex.org/W88459763","https://openalex.org/W1504892637","https://openalex.org/W1966079129","https://openalex.org/W1978264569","https://openalex.org/W2011193572","https://openalex.org/W2014369282","https://openalex.org/W2020267722","https://openalex.org/W2025924556","https://openalex.org/W2033885045","https://openalex.org/W2080379754","https://openalex.org/W2158760370","https://openalex.org/W2770775905","https://openalex.org/W4234897719","https://openalex.org/W4246962186"],"related_works":["https://openalex.org/W2950751115","https://openalex.org/W1504892637","https://openalex.org/W2597665901","https://openalex.org/W1916943706","https://openalex.org/W2167596143","https://openalex.org/W2004660767","https://openalex.org/W2099734427","https://openalex.org/W2013170874","https://openalex.org/W2009846993","https://openalex.org/W2683098551"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}