{"id":"https://openalex.org/W2104367271","doi":"https://doi.org/10.1109/infcom.2009.5062072","title":"Approximation Algorithms for Grooming in Optical Network Design","display_name":"Approximation Algorithms for Grooming in Optical Network Design","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2104367271","doi":"https://doi.org/10.1109/infcom.2009.5062072","mag":"2104367271"},"language":"en","primary_location":{"id":"doi:10.1109/infcom.2009.5062072","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5062072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","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/A5079501848","display_name":"Spyridon Antonakopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Antonakopoulos","raw_affiliation_strings":["Columbia Univ., New York, NY","Columbia University, New York, NY;"],"affiliations":[{"raw_affiliation_string":"Columbia Univ., New York, NY","institution_ids":["https://openalex.org/I78577930"]},{"raw_affiliation_string":"Columbia University, New York, NY;","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001006118","display_name":"L. Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L. Zhang","raw_affiliation_strings":["Bell Laboratories, Murray Hill, NJ, USA","Nokia (United States), Coppell, United States"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Nokia (United States), Coppell, United States","institution_ids":["https://openalex.org/I72090969"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079501848"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":3.085,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.91678738,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":null,"first_page":"1548","last_page":"1556"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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.9970999956130981,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9969000220298767,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/traffic-grooming","display_name":"Traffic grooming","score":0.8474477529525757},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7037034034729004},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.6436113119125366},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.6143657565116882},{"id":"https://openalex.org/keywords/bandwidth-allocation","display_name":"Bandwidth allocation","score":0.5177959203720093},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49881720542907715},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.440416157245636},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4343734383583069},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40816205739974976},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3832891285419464},{"id":"https://openalex.org/keywords/wavelength-division-multiplexing","display_name":"Wavelength-division multiplexing","score":0.3745965361595154},{"id":"https://openalex.org/keywords/wavelength","display_name":"Wavelength","score":0.3444294333457947},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3270089626312256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2565339505672455},{"id":"https://openalex.org/keywords/optics","display_name":"Optics","score":0.1452103555202484}],"concepts":[{"id":"https://openalex.org/C162396882","wikidata":"https://www.wikidata.org/wiki/Q7832502","display_name":"Traffic grooming","level":4,"score":0.8474477529525757},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7037034034729004},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.6436113119125366},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.6143657565116882},{"id":"https://openalex.org/C200157131","wikidata":"https://www.wikidata.org/wiki/Q4854763","display_name":"Bandwidth allocation","level":3,"score":0.5177959203720093},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49881720542907715},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.440416157245636},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4343734383583069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40816205739974976},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3832891285419464},{"id":"https://openalex.org/C160724564","wikidata":"https://www.wikidata.org/wiki/Q1620670","display_name":"Wavelength-division multiplexing","level":3,"score":0.3745965361595154},{"id":"https://openalex.org/C6260449","wikidata":"https://www.wikidata.org/wiki/Q41364","display_name":"Wavelength","level":2,"score":0.3444294333457947},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3270089626312256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2565339505672455},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.1452103555202484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/infcom.2009.5062072","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2009.5062072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2009","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W185651092","https://openalex.org/W1480013244","https://openalex.org/W1575996043","https://openalex.org/W1988738482","https://openalex.org/W2006249627","https://openalex.org/W2025002731","https://openalex.org/W2059936808","https://openalex.org/W2060363698","https://openalex.org/W2070642495","https://openalex.org/W2088168571","https://openalex.org/W2091737416","https://openalex.org/W2100266001","https://openalex.org/W2100937099","https://openalex.org/W2110392994","https://openalex.org/W2115755077","https://openalex.org/W2117995340","https://openalex.org/W2133156969","https://openalex.org/W2139721783","https://openalex.org/W2151446881","https://openalex.org/W2152683299","https://openalex.org/W2169143327","https://openalex.org/W2484452280","https://openalex.org/W6607498392","https://openalex.org/W6667025859","https://openalex.org/W6722385208"],"related_works":["https://openalex.org/W4232008900","https://openalex.org/W2177526578","https://openalex.org/W2141444529","https://openalex.org/W2121535467","https://openalex.org/W1967966277","https://openalex.org/W2098313090","https://openalex.org/W2355755270","https://openalex.org/W2061539918","https://openalex.org/W2026383864","https://openalex.org/W2119147011"],"abstract_inverted_index":{"We":[0,113,245],"study":[1,114],"traffic":[2,14,28,153,188],"grooming":[3,93],"in":[4,33,243,257],"optical":[5],"network":[6,185],"design.":[7],"The":[8],"goal":[9],"is":[10,39,118,132],"to":[11,16,30,40,119,125,134,166,228,248,253],"aggregate":[12],"low-bandwidth":[13],"streams":[15],"efficiently":[17],"utilize":[18],"high-bandwidth":[19],"media":[20],"such":[21,47,231,239],"as":[22,232,240,272],"wavelength":[23],"channels.":[24],"More":[25],"precisely,":[26],"given":[27],"demands":[29,68,154,189,221],"be":[31],"routed":[32],"a":[34,42,53,71,81,149,198,205],"network,":[35],"the":[36,96,127,130,136,143,173,178,216,263,268],"design":[37],"problem":[38,271],"define":[41],"collection":[43],"of":[44,55,138,148,181,194,219,267],"light":[45,57,60,73,82,128,139,209],"paths":[46],"that":[48,155,161,190,215],"each":[49],"demand":[50],"can":[51],"follow":[52],"sequence":[54],"consecutive":[56],"paths.":[58,140],"Each":[59],"path":[61,83,210],"has":[62,222],"unit-wavelength":[63],"bandwidth,":[64,158,195],"and":[65,78,99,152,187,204,235,265],"multiple":[66],"sub-wavelength":[67],"may":[69],"share":[70],"common":[72],"path.":[74],"Traffic":[75],"must":[76],"enter":[77],"depart":[79],"from":[80],"at":[84],"its":[85],"two":[86,115],"endpoints":[87],"only.":[88],"Most":[89],"previous":[90],"work":[91],"on":[92,95],"focused":[94],"ring":[97],"topology":[98,151],"typically":[100],"dealt":[101],"only":[102],"with":[103],"uniform":[104],"bandwidth":[105],"demands,":[106],"whereas":[107],"we":[108,159,170,196,213],"consider":[109],"more":[110],"general":[111],"settings.":[112],"objectives.":[116],"One":[117],"minimize":[120,135],"total":[121],"equipment":[122],"cost":[123,202],"necessary":[124],"support":[126],"paths;":[129],"other":[131,179],"simply":[133],"number":[137],"Even":[141],"for":[142,183,201,207],"extremely":[144],"restricted":[145],"special":[146,217],"case":[147,218],"line":[150],"request":[156,191],"half-wavelength":[157,220],"show":[160,197,246],"both":[162,250],"objectives":[163,251],"are":[164],"APX-hard":[165],"optimize,":[167],"which":[168],"means":[169],"cannot":[171],"approximate":[172,249],"optimum":[174],"arbitrarily":[175],"closely.":[176],"On":[177],"extreme":[180],"generality,":[182],"arbitrary":[184,192],"topologies":[186],"amounts":[193],"logarithmic":[199],"approximation":[200,264],"minimization":[203],"2-approximation":[206],"minimizing":[208],"counts.":[211],"Furthermore,":[212],"discover":[214],"rich":[223],"combinatorial":[224],"properties,":[225],"closely":[226],"related":[227],"graph":[229],"problems":[230,238],"cycle":[233],"packing":[234],"pattern":[236],"matching":[237],"interchange":[241,269],"distance":[242,270],"strings.":[244],"how":[247],"up":[252],"small":[254],"constant":[255],"factors":[256],"this":[258],"case,":[259],"while":[260],"similarly":[261],"improving":[262],"hardness":[266],"well.":[273]},"counts_by_year":[{"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"}