{"id":"https://openalex.org/W4312883194","doi":"https://doi.org/10.1007/978-3-031-18530-4_24","title":"Polynomial-Time Approximation Schemes for\u00a0a\u00a0Class of\u00a0Integrated Network Design and\u00a0Scheduling Problems with\u00a0Parallel Identical Machines","display_name":"Polynomial-Time Approximation Schemes for\u00a0a\u00a0Class of\u00a0Integrated Network Design and\u00a0Scheduling Problems with\u00a0Parallel Identical Machines","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4312883194","doi":"https://doi.org/10.1007/978-3-031-18530-4_24"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-18530-4_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-18530-4_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":"conference-paper","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/A5082253523","display_name":"Y\u00fbsuke Saito","orcid":"https://orcid.org/0000-0002-2589-7411"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yusuke Saito","raw_affiliation_strings":["Tokyo Institute of Technology, Tokyo, 152-8550, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo Institute of Technology, Tokyo, 152-8550, Japan","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067169957","display_name":"Akiyoshi Shioura","orcid":"https://orcid.org/0000-0002-5216-7190"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Akiyoshi Shioura","raw_affiliation_strings":["Tokyo Institute of Technology, Tokyo, 152-8550, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tokyo Institute of Technology, Tokyo, 152-8550, Japan","institution_ids":["https://openalex.org/I114531698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067169957"],"corresponding_institution_ids":["https://openalex.org/I114531698"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.2435,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78975799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"324","last_page":"335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.998199999332428,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6291980743408203},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6121652126312256},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5469770431518555},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5227980017662048},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5129139423370361},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4947759509086609},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.45888999104499817},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45768821239471436},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44771355390548706},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4277706742286682},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3738805055618286},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3473857641220093},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34505701065063477},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2726769745349884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26491010189056396},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11000677943229675},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10415884852409363},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.07835757732391357}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6291980743408203},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6121652126312256},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5469770431518555},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5227980017662048},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5129139423370361},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4947759509086609},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.45888999104499817},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45768821239471436},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44771355390548706},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4277706742286682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3738805055618286},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3473857641220093},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34505701065063477},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2726769745349884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26491010189056396},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11000677943229675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10415884852409363},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.07835757732391357}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-18530-4_24","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-18530-4_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":[{"id":"https://openalex.org/G6227736215","display_name":"Research on Discrete Convex Analysis Approach for Robust Nonlinear Integer Programming Problems","funder_award_id":"18K11177","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1556368910","https://openalex.org/W1576317141","https://openalex.org/W1624361598","https://openalex.org/W1969076261","https://openalex.org/W1988565742","https://openalex.org/W1991615243","https://openalex.org/W2000444555","https://openalex.org/W2012228660","https://openalex.org/W2027517531","https://openalex.org/W2065000990","https://openalex.org/W2072770236","https://openalex.org/W2087281053","https://openalex.org/W2104399828","https://openalex.org/W2130626677","https://openalex.org/W2999411994","https://openalex.org/W3102662246","https://openalex.org/W3139513104","https://openalex.org/W3202778794","https://openalex.org/W4206350528"],"related_works":["https://openalex.org/W1993080431","https://openalex.org/W2740635957","https://openalex.org/W2272917567","https://openalex.org/W2193919580","https://openalex.org/W2089406119","https://openalex.org/W3100126389","https://openalex.org/W4245317282","https://openalex.org/W3127756288","https://openalex.org/W2188553320","https://openalex.org/W4312883194"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":3}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}