{"id":"https://openalex.org/W2912683058","doi":"https://doi.org/10.1109/cdc.2018.8619739","title":"Conic Approximation with Provable Guarantee for Traffic Signal Offset Optimization","display_name":"Conic Approximation with Provable Guarantee for Traffic Signal Offset Optimization","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2912683058","doi":"https://doi.org/10.1109/cdc.2018.8619739","mag":"2912683058"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2018.8619739","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8619739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","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/A5100627878","display_name":"Yi Ouyang","orcid":"https://orcid.org/0000-0003-0556-4393"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yi Ouyang","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079119611","display_name":"Richard Y. Zhang","orcid":"https://orcid.org/0000-0003-3980-2791"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Y. Zhang","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042580848","display_name":"Javad Lavaei","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Javad Lavaei","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040150415","display_name":"Pravin Varaiya","orcid":"https://orcid.org/0000-0002-1900-9932"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pravin Varaiya","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100627878"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.3679,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.63702217,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"42","issue":null,"first_page":"229","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10524","display_name":"Traffic control and management","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10698","display_name":"Transportation Planning and Optimization","score":0.9740999937057495,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9688000082969666,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.643216609954834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6029213070869446},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5851749777793884},{"id":"https://openalex.org/keywords/offset","display_name":"Offset (computer science)","score":0.5563054084777832},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.555152416229248},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5406342148780823},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5403481125831604},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5375269651412964},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4915634095668793},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.46075138449668884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34498608112335205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30194729566574097},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16521424055099487},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16286468505859375}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.643216609954834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6029213070869446},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5851749777793884},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.5563054084777832},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.555152416229248},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5406342148780823},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5403481125831604},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5375269651412964},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4915634095668793},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.46075138449668884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34498608112335205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30194729566574097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16521424055099487},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16286468505859375},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2018.8619739","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8619739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","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":28,"referenced_works":["https://openalex.org/W132374903","https://openalex.org/W1479709154","https://openalex.org/W1595704756","https://openalex.org/W1852767571","https://openalex.org/W1965408066","https://openalex.org/W1967893377","https://openalex.org/W1969094469","https://openalex.org/W1974442146","https://openalex.org/W1985123706","https://openalex.org/W1996215314","https://openalex.org/W2027562075","https://openalex.org/W2029448190","https://openalex.org/W2071143636","https://openalex.org/W2085523940","https://openalex.org/W2085550081","https://openalex.org/W2259690454","https://openalex.org/W2327238720","https://openalex.org/W2401610261","https://openalex.org/W2588904978","https://openalex.org/W2594893535","https://openalex.org/W2605372297","https://openalex.org/W2735315598","https://openalex.org/W2964181913","https://openalex.org/W4236826464","https://openalex.org/W4243121158","https://openalex.org/W4292070118","https://openalex.org/W6736144679","https://openalex.org/W6745317117"],"related_works":["https://openalex.org/W2084086280","https://openalex.org/W2027198738","https://openalex.org/W2397767885","https://openalex.org/W237421766","https://openalex.org/W3013712002","https://openalex.org/W2083114070","https://openalex.org/W2004392729","https://openalex.org/W2010164741","https://openalex.org/W136166990","https://openalex.org/W1934849835"],"abstract_inverted_index":{"We":[0,22],"consider":[1],"the":[2,8,29,41,45,60,95,99,113,121,136,139,145,155,162,176,185],"offset":[3,30,100],"optimization":[4,31,101],"problem":[5,32,115],"that":[6,27,89,124,135,175],"coordinates":[7],"offsets":[9],"of":[10,44,63,81,98,138,147,151,187,195],"signalized":[11,19],"intersections":[12],"to":[13,53,75,84,92,111],"reduce":[14],"vehicle":[15],"queues":[16],"in":[17],"large-scale":[18,70,114],"traffic":[20,82,127],"networks.":[21,168],"adopt":[23],"a":[24,34,49,55,64,86,108,117,125,130,179,191],"recent":[25],"approach":[26],"transforms":[28],"into":[33,116],"complex-valued":[35],"quadratically-constrained":[36],"quadratic":[37],"program":[38,66],"(QCQP).":[39],"Using":[40],"special":[42],"structure":[43],"QCQP,":[46],"we":[47,77,133],"provide":[48],"\u03c0":[50],"/4-approximation":[51],"algorithm":[52,88,105,141,177],"find":[54],"near-global":[56],"solution":[57,62],"based":[58],"on":[59,107,161],"optimal":[61,193],"semidefinite":[65],"(SDP)":[67],"relaxation.":[68],"Although":[69],"SDPs":[71],"are":[72,159],"generally":[73],"hard":[74],"solve,":[76],"exploit":[78],"sparsity":[79],"structures":[80],"networks":[83],"propose":[85],"numerical":[87,170],"is":[90,173],"able":[91],"efficiently":[93],"solve":[94],"SDP":[96],"relaxation":[97],"problem.":[102],"The":[103,149],"developed":[104],"relies":[106],"tree":[109],"decomposition":[110],"reformulate":[112],"reduced-complexity":[118],"SDP.":[119],"Under":[120],"practical":[122],"assumption":[123],"real-world":[126],"network":[128],"has":[129,178],"bounded":[131,156],"treewidth,":[132],"show":[134],"complexity":[137],"overall":[140],"scales":[142],"near-linearly":[143],"with":[144],"number":[146],"intersections.":[148],"results":[150],"this":[152],"work,":[153],"including":[154],"treewidth":[157],"property,":[158],"demonstrated":[160],"Berkeley,":[163],"Manhattan,":[164],"and":[165,184],"Los":[166],"Angeles":[167],"From":[169],"experiments":[171],"it":[172],"observed":[174],"linear":[180],"empirical":[181],"time":[182],"complexity,":[183],"solutions":[186],"all":[188],"cases":[189],"achieve":[190],"near-globally":[192],"guarantee":[194],"more":[196],"than":[197],"0.99.":[198]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}