{"id":"https://openalex.org/W2558060969","doi":"https://doi.org/10.1007/978-3-319-53007-9_26","title":"The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)","display_name":"The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract)","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2558060969","doi":"https://doi.org/10.1007/978-3-319-53007-9_26","mag":"2558060969"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-53007-9_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53007-9_26","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/A5044476625","display_name":"Abdullah Makkeh","orcid":"https://orcid.org/0000-0002-3581-8262"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":true,"raw_author_name":"Abdullah Makkeh","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, \u00dclikooli 17, 51014, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, \u00dclikooli 17, 51014, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010119890","display_name":"Mozhgan Pourmoradnasseri","orcid":"https://orcid.org/0000-0002-2092-816X"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Mozhgan Pourmoradnasseri","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, \u00dclikooli 17, 51014, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, \u00dclikooli 17, 51014, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070611630","display_name":"Dirk Oliver Theis","orcid":"https://orcid.org/0000-0002-9362-0748"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Dirk Oliver Theis","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, \u00dclikooli 17, 51014, Tartu, Estonia"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, \u00dclikooli 17, 51014, Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044476625"],"corresponding_institution_ids":["https://openalex.org/I56085075"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7044,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6784881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"294","last_page":"307"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9883999824523926,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9883999824523926,"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/polytope","display_name":"Polytope","score":0.8935966491699219},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.862258791923523},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5989242196083069},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5350310206413269},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.505732536315918},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42763853073120117},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.42475542426109314},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3749871551990509},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3213614225387573},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.1832824945449829},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12114697694778442},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.05766090750694275}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8935966491699219},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.862258791923523},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5989242196083069},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5350310206413269},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.505732536315918},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42763853073120117},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.42475542426109314},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3749871551990509},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3213614225387573},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.1832824945449829},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12114697694778442},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.05766090750694275},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-53007-9_26","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-53007-9_26","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":[{"id":"https://metadata.un.org/sdg/10","score":0.46000000834465027,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1656577714","https://openalex.org/W1964127155","https://openalex.org/W1965650902","https://openalex.org/W1986105362","https://openalex.org/W2000825158","https://openalex.org/W2003186772","https://openalex.org/W2005283421","https://openalex.org/W2009572235","https://openalex.org/W2018781529","https://openalex.org/W2042483675","https://openalex.org/W2056368398","https://openalex.org/W2074023061","https://openalex.org/W2076551133","https://openalex.org/W2081534497","https://openalex.org/W2086332879","https://openalex.org/W2090715877","https://openalex.org/W2107702527","https://openalex.org/W2145175615","https://openalex.org/W2151888904","https://openalex.org/W2171367973","https://openalex.org/W2557957061","https://openalex.org/W2761721377","https://openalex.org/W2988480584","https://openalex.org/W3105031228","https://openalex.org/W6819472549"],"related_works":["https://openalex.org/W2953076628","https://openalex.org/W2085110259","https://openalex.org/W2963837916","https://openalex.org/W2949863507","https://openalex.org/W2773485609","https://openalex.org/W4297969877","https://openalex.org/W1854884900","https://openalex.org/W2953291927","https://openalex.org/W4287661028","https://openalex.org/W2778515850"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}