{"id":"https://openalex.org/W2074675257","doi":"https://doi.org/10.1109/rivf.2012.6169860","title":"An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem","display_name":"An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem","publication_year":2012,"publication_date":"2012-02-01","ids":{"openalex":"https://openalex.org/W2074675257","doi":"https://doi.org/10.1109/rivf.2012.6169860","mag":"2074675257"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2012.6169860","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2012.6169860","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","raw_type":"proceedings-article"},"type":"article","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/A5037843488","display_name":"Ha-Bang Ban","orcid":"https://orcid.org/0000-0003-2241-5146"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Ha Bang Ban","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","Sch. of Inf. & Commun. Technol., Ha Noi Univ. of Sci. & Technol., Ha Noi, Vietnam"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"Sch. of Inf. & Commun. Technol., Ha Noi Univ. of Sci. & Technol., Ha Noi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074852186","display_name":"\u0110\u1ee9c Ngh\u0129a Nguy\u1ec5n","orcid":"https://orcid.org/0000-0001-7172-0548"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Duc Nghia Nguyen","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","Sch. of Inf. & Commun. Technol., Ha Noi Univ. of Sci. & Technol., Ha Noi, Vietnam"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"Sch. of Inf. & Commun. Technol., Ha Noi Univ. of Sci. & Technol., Ha Noi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5037843488"],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.20268027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"37","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9984999895095825,"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.9984999895095825,"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.9984999895095825,"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/T11106","display_name":"Data Management and Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.738265335559845},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.6344490647315979},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6008707880973816},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5981125235557556},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5514236688613892},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.500216007232666},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.4860123097896576},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4776560068130493},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4523440897464752},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43590012192726135},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38034576177597046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29628986120224}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.738265335559845},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.6344490647315979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6008707880973816},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5981125235557556},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5514236688613892},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.500216007232666},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4860123097896576},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4776560068130493},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4523440897464752},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43590012192726135},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38034576177597046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29628986120224},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2012.6169860","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2012.6169860","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1966793805","https://openalex.org/W2005117954","https://openalex.org/W2009279347","https://openalex.org/W2011595401","https://openalex.org/W2038190710","https://openalex.org/W2078610911","https://openalex.org/W2093376706","https://openalex.org/W2116018028","https://openalex.org/W2129522056"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2098281589","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W2110817230","https://openalex.org/W1606488336","https://openalex.org/W1694364829","https://openalex.org/W1903284337","https://openalex.org/W2074675257"],"abstract_inverted_index":{"Minimum":[0],"Latency":[1],"Problem":[2],"is":[3,19,34,42,83],"a":[4,29,43,67,84],"class":[5],"of":[6,60,86,96,104,131,135,142],"combinational":[7],"optimization":[8],"problems":[9],"which":[10,99],"have":[11],"many":[12],"practical":[13],"applications.":[14],"In":[15,50,93,110],"general,":[16],"the":[17,48,61,89,105,119],"problem":[18],"proved":[20],"to":[21,36,113,125],"be":[22],"NP-hard":[23],"and":[24,81,127,140],"unless":[25],"P":[26],"=":[27],"NP,":[28],"polynomial":[30],"time":[31,78,139],"approximation":[32,40,54,75],"scheme":[33],"unlikely":[35],"exist.":[37],"Therefore,":[38],"using":[39],"algorithm":[41],"suitable":[44],"approach":[45,112],"for":[46],"solving":[47],"problem.":[49],"recent":[51],"times,":[52],"several":[53,122],"algorithms":[55,62,90,120],"were":[56],"proposed.":[57],"However,":[58],"efficiency":[59,130],"was":[63,100,107],"only":[64],"evaluated":[65],"in":[66,79,133],"theoretical":[68],"manner.":[69],"They":[70],"did":[71],"not":[72,108],"indicate":[73],"real":[74,129,136],"ratio,":[76,137],"running":[77,138],"reality":[80],"there":[82],"lack":[85],"comparison":[87],"between":[88],"from":[91],"experiments.":[92],"addition,":[94],"quality":[95,141],"lower":[97,143],"bound,":[98],"an":[101,111],"important":[102],"part":[103],"algorithms,":[106],"mentioned.":[109],"fulfill":[114],"these":[115],"omissions,":[116],"we":[117],"implemented":[118],"on":[121],"test":[123],"data":[124],"evaluate":[126],"compare":[128],"them":[132],"terms":[134],"bound.":[144]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}