{"id":"https://openalex.org/W2076419391","doi":"https://doi.org/10.1137/s0895480101386723","title":"Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings","display_name":"Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2076419391","doi":"https://doi.org/10.1137/s0895480101386723","mag":"2076419391"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480101386723","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480101386723","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-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/A5101427454","display_name":"Christine T. Cheng","orcid":"https://orcid.org/0000-0003-0524-5368"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Christine T. Cheng","raw_affiliation_strings":["Johns Hopkins University ("],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University (","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101427454"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":1.3487,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.80818574,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"3","first_page":"384","last_page":"402"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.9979000091552734,"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/mathematics","display_name":"Mathematics","score":0.7008489966392517},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6198432445526123},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5879849195480347},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5451518893241882},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4964209198951721},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.4877796769142151},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42548424005508423},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4074726998806},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3818991780281067},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16522961854934692}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7008489966392517},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6198432445526123},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5879849195480347},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5451518893241882},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4964209198951721},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.4877796769142151},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42548424005508423},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4074726998806},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3818991780281067},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16522961854934692},{"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/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480101386723","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480101386723","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W143397","https://openalex.org/W1515357878","https://openalex.org/W1535485970","https://openalex.org/W1544465588","https://openalex.org/W1571238052","https://openalex.org/W1982667852","https://openalex.org/W2007610258","https://openalex.org/W2012729006","https://openalex.org/W2012969943","https://openalex.org/W2013530391","https://openalex.org/W2045970714","https://openalex.org/W2052850644","https://openalex.org/W2061040942","https://openalex.org/W2074937107","https://openalex.org/W2092288198","https://openalex.org/W2094329068","https://openalex.org/W2110394847","https://openalex.org/W2127394866","https://openalex.org/W2143474538","https://openalex.org/W2320198223"],"related_works":["https://openalex.org/W1480883248","https://openalex.org/W2172406734","https://openalex.org/W1829226603","https://openalex.org/W2960420609","https://openalex.org/W2074555287","https://openalex.org/W1989669912","https://openalex.org/W3170602412","https://openalex.org/W2166143359","https://openalex.org/W3123672655","https://openalex.org/W1998394478"],"abstract_inverted_index":{"In":[0,201],"the":[1,49,57,95,100,103,113,116,141,148,163,196,238],"demand":[2,85,107],"routing":[3],"and":[4,37,157],"slotting":[5],"problem":[6],"on":[7,19,94],"unit":[8,17],"demands":[9,18],"(unit-DRSP),":[10],"we":[11,204],"are":[12],"given":[13],"a":[14,27,39,77,92,120,177,213,222],"set":[15,105],"of":[16,60,86,102,106,115,150,155,162,225,245],"an":[20,136,169],"n-node":[21,137],"ring.":[22,96,117],"Each":[23],"demand,":[24],"which":[25],"is":[26,54,64,69,80,140,167,192,233],"(source,":[28],"destination)":[29],"pair,":[30],"must":[31],"be":[32,89],"routed":[33],"clockwise":[34],"or":[35],"counterclockwise":[36],"assigned":[38],"slot":[40],"so":[41],"that":[42,46,67,79,109,124,146,179,217],"no":[43],"two":[44],"routes":[45],"overlap":[47],"occupy":[48],"same":[50],"slot.":[51],"The":[52,71],"objective":[53],"to":[55],"minimize":[56],"total":[58],"number":[59],"slots":[61,134],"used.":[62],"It":[63],"well":[65],"known":[66],"unit-DRSP":[68,87],"NP-complete.":[70],"best":[72],"deterministic":[73,143],"approximation":[74,122,144,215,239],"algorithm":[75,123,145,170,209,216],"guarantees":[76],"solution":[78,178],"2":[81,151],"\u00d7":[82],"OPT.":[83,246],"A":[84],"can":[88,198],"viewed":[90],"as":[91],"chord":[93],"Let":[97],"w":[98],"denote":[99],"size":[101],"largest":[104],"chords":[108],"mutually":[110],"cross":[111],"in":[112,135],"interior":[114],"We":[118],"present":[119],"simple":[121],"uses":[125,180],"at":[126],"most":[127],"$(2":[128],"-":[129,227],"1/\\lceil":[130],"w/2":[131],"\\rceil)\\times":[132],"OPT$":[133,187],"network;":[138],"this":[139,202],"first":[142],"beats":[147],"factor":[149,197,224,240],"for":[152,159,242],"all":[153,160,243],"values":[154,244],"OPT":[156,191],"therefore":[158],"instances":[161],"input.":[164],"If":[165],"randomization":[166],"allowed,":[168],"by":[171],"Kumar":[172],"produces,":[173],"with":[174,210,219],"high":[175,220],"probability,":[176,221],"asymptotically":[181,231],"$(1.5":[182],"+":[183],"\\frac{1}{2e}":[184],"+o(1))":[185],"\\times":[186],"slots.":[188],"However,":[189],"when":[190],"not":[193,234],"large":[194],"enough,":[195],"exceed":[199],"2.":[200],"paper,":[203],"show":[205],"how":[206],"combining":[207],"our":[208],"Kumar's":[211],"yields":[212],"randomized":[214],"has,":[218],"constant":[223],"$2":[226],"1/\\theta(\\log":[228],"n)$.":[229],"While":[230],"it":[232],"better":[235],"than":[236],"Kumar's,":[237],"holds":[241]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}