{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T01:10:27Z","timestamp":1708996227804},"reference-count":16,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T00:00:00Z","timestamp":1212451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"NSF","award":["ANI-0240524"],"award-info":[{"award-number":["ANI-0240524"]}]},{"name":"MIUR-Italy"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2008,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In a problem arising in grooming for two\u2010period optical networks, it is required to decompose the complete graph on<jats:italic>n<\/jats:italic>vertices into subgraphs each containing at most<jats:italic>C<\/jats:italic>edges, so that the induced subgraphs on a specified set of<jats:italic>v<\/jats:italic>\u2264<jats:italic>n<\/jats:italic>vertices each contain at most<jats:italic>C<\/jats:italic>\u2032 &lt;<jats:italic>C<\/jats:italic>edges. The cost of the grooming is the sum, over all subgraphs, of the number of vertices of nonzero degree in the subgraph. The optimum grooming is the one of lowest cost. An integer linear programming formulation is used to determine precise lower bounds on this minimum cost for all choices of<jats:italic>n<\/jats:italic>and<jats:italic>v<\/jats:italic>when 1 \u2264<jats:italic>C<\/jats:italic>\u2032 &lt;<jats:italic>C<\/jats:italic>\u2264 3. In most cases, this approach determines not only the bound but also the specific structure of any grooming that could realize the bound. \u00a9 2008 Wiley Periodicals, Inc. NETWORKS, 2008<\/jats:p>","DOI":"10.1002\/net.20251","type":"journal-article","created":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T22:46:50Z","timestamp":1212533210000},"page":"299-306","source":"Crossref","is-referenced-by-count":3,"title":["Lower bounds for two\u2010period grooming via linear programming duality"],"prefix":"10.1002","volume":"52","author":[{"given":"Charles J.","family":"Colbourn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaetano","family":"Quattrocchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Violet R.","family":"Syrotiuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2008,6,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.10061"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104444314"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2003.11.023"},{"key":"e_1_2_1_5_2","series-title":"Traffic grooming in unidirectional WDM ring networks using design theory, Proc IEEE Conf Commun (ICC'03), IEEE","first-page":"1402","author":"Bermond J.\u2010C.","year":"2003"},{"key":"e_1_2_1_6_2","article-title":"A survey on the existence of G\u2010designs","author":"Bryant D.","journal-title":"J Combin Des"},{"key":"e_1_2_1_7_2","volume-title":"Handbook of combinatorial designs","author":"Colbourn C. J.","year":"2007"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.10044"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.20252"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198535768.001.0001","volume-title":"Triple systems","author":"Colbourn C. J.","year":"1999"},{"key":"e_1_2_1_11_2","volume-title":"Combinatorial optimization","author":"Cook W. J.","year":"1998"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2002.1081765"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1364\/JON.1.000032","article-title":"Optimal traffic grooming for wavelength\u2010division multiplexing rings with all\u2010to\u2010all uniform traffic","volume":"1","author":"Hu J. Q.","year":"2002","journal-title":"J Opt Networks"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/35.933446"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00410-1"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/50.737421"},{"key":"e_1_2_1_17_2","volume-title":"Multichannel optical networks","author":"Wan P.\u2010J.","year":"2000"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20251","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20251","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.20251","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T00:52:35Z","timestamp":1708995155000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,3]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["10.1002\/net.20251"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/net.20251","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,3]]}}}