{"id":"https://openalex.org/W2171142841","doi":"https://doi.org/10.1109/icc.2003.1204174","title":"Routing with many additive QoS constraints","display_name":"Routing with many additive QoS constraints","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2171142841","doi":"https://doi.org/10.1109/icc.2003.1204174","mag":"2171142841"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2003.1204174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1204174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2003. ICC '03.","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/A5026230689","display_name":"Guoliang Xue","orcid":"https://orcid.org/0000-0002-5833-8894"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Guoliang Xue","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112073042","display_name":"A. Sen","orcid":"https://orcid.org/0009-0006-3877-7255"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Sen","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016475978","display_name":"R. Banka","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Banka","raw_affiliation_strings":["Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Arizona State University, Tempe, AZ, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026230689"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":2.5493,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.91375132,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"223","last_page":"227"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.7235159277915955},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.683789074420929},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6546845436096191},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.639560878276825},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.610789954662323},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.610227108001709},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6004844307899475},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5932714939117432},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5099397897720337},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4633062481880188},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45846638083457947},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45776867866516113},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.43474486470222473},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3346796929836273},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3305089771747589},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.308410108089447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21102118492126465},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0820557177066803}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7235159277915955},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.683789074420929},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6546845436096191},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.639560878276825},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.610789954662323},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.610227108001709},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6004844307899475},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5932714939117432},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5099397897720337},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4633062481880188},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45846638083457947},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45776867866516113},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.43474486470222473},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3346796929836273},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3305089771747589},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.308410108089447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21102118492126465},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0820557177066803},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/icc.2003.1204174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2003.1204174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Communications, 2003. ICC '03.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1506184069","https://openalex.org/W1511591825","https://openalex.org/W2006543170","https://openalex.org/W2011039300","https://openalex.org/W2066047491","https://openalex.org/W2074117023","https://openalex.org/W2084224084","https://openalex.org/W2096774592","https://openalex.org/W2112169033","https://openalex.org/W2114480880","https://openalex.org/W2115319629","https://openalex.org/W2127456145","https://openalex.org/W2130626677","https://openalex.org/W2151688044","https://openalex.org/W2154355266","https://openalex.org/W2157993733","https://openalex.org/W2170358592","https://openalex.org/W2171074980","https://openalex.org/W6677348609","https://openalex.org/W6682908328","https://openalex.org/W6685121600"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2048358792","https://openalex.org/W2098281589","https://openalex.org/W2970302286","https://openalex.org/W1443174385","https://openalex.org/W2732982824","https://openalex.org/W3123730328","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"problem":[2,30,56,104],"in":[3,31,92,106],"QoS":[4],"routing":[5],"is":[6,49,58,113],"to":[7],"find":[8],"a":[9,12,19,32,65,96,109],"path":[10,54],"between":[11],"specified":[13],"source-destination":[14],"node":[15],"pair":[16],"that":[17,51,81,121],"satisfies":[18],"set":[20],"of":[21,24,41,75,98,102,120,122],"end-to-end":[22],"quality":[23,40],"service":[25,42],"constraints.":[26],"We":[27],"study":[28],"this":[29,61],"communication":[33],"system":[34],"where":[35],"there":[36],"are":[37],"multiple":[38],"additive":[39],"parameters":[43],"associated":[44],"with":[45],"each":[46],"link.":[47],"It":[48],"well-known":[50],"the":[52,76,99,103,123],"multi-constrained":[53],"selection":[55],"(MCPS)":[57],"NP-complete.":[59],"In":[60],"paper,":[62],"we":[63,89],"present":[64],"fully":[66],"polynomial":[67,97],"time":[68,93],"approximation":[69],"scheme":[70],"for":[71,82],"an":[72],"optimization":[73],"version":[74],"MCPS":[77],"problem.":[78],"This":[79],"means":[80],"any":[83],"given":[84],"/spl":[85,118],"epsi/":[86],">":[87],"0,":[88],"can":[90],"compute,":[91],"bounded":[94],"by":[95],"input":[100],"size":[101],"and":[105],"1//spl":[107],"epsi/,":[108],"solution":[110],"whose":[111],"cost":[112],"at":[114],"most":[115],"(1":[116],"+":[117],"epsi/)":[119],"optimal":[124],"solution.":[125]},"counts_by_year":[{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}