{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:01Z","timestamp":1750307521286,"version":"3.41.0"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T00:00:00Z","timestamp":1253836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2009,9,25]]},"DOI":"10.1145\/1620491.1620508","type":"journal-article","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T18:18:59Z","timestamp":1254853139000},"page":"86-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["SIGACT news online algorithms column 14"],"prefix":"10.1145","volume":"40","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[{"name":"University of California, Riverside, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,9,25]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Models and solution techniques for frequency assignment problems. Quarterly Journal of the Belgian, French and Italian Operations Research Societies (4OR), 1(4):261--317","author":"Aardal K.I.","year":"2003","unstructured":"K.I. Aardal , S.P.M. van Hoesel , A.M.C.A. Koster , C. Mannino , and A. Sassano . Models and solution techniques for frequency assignment problems. Quarterly Journal of the Belgian, French and Italian Operations Research Societies (4OR), 1(4):261--317 , 2003 . K.I. Aardal, S.P.M. van Hoesel, A.M.C.A. Koster, C. Mannino, and A. Sassano. Models and solution techniques for frequency assignment problems. Quarterly Journal of the Belgian, French and Italian Operations Research Societies (4OR), 1(4):261--317, 2003."},{"key":"e_1_2_1_2_1","volume-title":"Online Computation and Competitive Analysis","author":"Borodin A.","year":"1998","unstructured":"A. Borodin and R. El-Yaniv . Online Computation and Competitive Analysis . Cambridge University Press , 1998 . A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011957904108"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2697438.2697656"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-002-1003-4"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02882-3_36"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11940128_8"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.11.015"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248377.1248418"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72870-2_18"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2394650.2394701"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781574.1781626"},{"key":"e_1_2_1_13_1","unstructured":"F.Y.L. Chin H.F. Ting and Y. Zhang. Constant-Competitive Tree Node Assignment. manuscript.  F.Y.L. Chin H.F. Ting and Y. Zhang. Constant-Competitive Tree Node Assignment. manuscript."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02158-9_12"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065910.1065942"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.76413"},{"key":"e_1_2_1_18_1","first-page":"135","article-title":"Independence and Coloring Problems on Intersection Graphs of Disks. Efficient Approximation and Online Algorithms","volume":"3484","author":"Erlebach T.","year":"2006","unstructured":"T. Erlebach and J. Fiala . Independence and Coloring Problems on Intersection Graphs of Disks. Efficient Approximation and Online Algorithms , LNCS 3484 , pp 135 -- 155 , 2006 . T. Erlebach and J. Fiala. Independence and Coloring Problems on Intersection Graphs of Disks. Efficient Approximation and Online Algorithms, LNCS 3484, pp 135--155, 2006.","journal-title":"LNCS"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_24"},{"key":"e_1_2_1_20_1","unstructured":"T. Erlebach R. Jacob and Marco Tomamichel. Algorithmische Aspekte von OVSF Code Assignment mit Schwerpunkt auf Offline Code Assignment. Student thesis at ETH Z\u00fcrich.  T. Erlebach R. Jacob and Marco Tomamichel. Algorithmische Aspekte von OVSF Code Assignment mit Schwerpunkt auf Offline Code Assignment. Student thesis at ETH Z\u00fcrich."},{"key":"e_1_2_1_21_1","first-page":"464","volume-title":"Proc. of the 9th Annual European Symposim on Algorithms (ESA 01)","author":"Fiala J.","unstructured":"J. Fiala , A.V. Fishkin , and F.V. Fomin . Offline and on-line distance constrained labeling of graphs . In Proc. of the 9th Annual European Symposim on Algorithms (ESA 01) , LNCS 2161, pp. 464 -- 475 . J. Fiala, A.V. Fishkin, and F.V. Fomin. Offline and on-line distance constrained labeling of graphs. In Proc. of the 9th Annual European Symposim on Algorithms (ESA 01), LNCS 2161, pp. 464--475."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778631"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11899"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00241-7"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1068"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5087-7_13"},{"key":"e_1_2_1_27_1","first-page":"126","volume-title":"Li and Peng-Jun Wan. Theoretically Good Distributed CDMA\/OVSF Code Assignment for Wireless Ad Hoc Networks. In Proc. the 11th Annual International Conference of Computing and Combinatorics (COCOON05)","author":"Xiang-Yang","unstructured":"Xiang-Yang Li and Peng-Jun Wan. Theoretically Good Distributed CDMA\/OVSF Code Assignment for Wireless Ad Hoc Networks. In Proc. the 11th Annual International Conference of Computing and Combinatorics (COCOON05) , pp. 126 -- 135 . Xiang-Yang Li and Peng-Jun Wan. Theoretically Good Distributed CDMA\/OVSF Code Assignment for Wireless Ad Hoc Networks. In Proc. the 11th Annual International Conference of Computing and Combinatorics (COCOON05), pp. 126--135."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/365628.365655"},{"key":"e_1_2_1_29_1","volume-title":"Fundamental Algorithms","author":"Knuth Donald E.","year":"1975","unstructured":"Donald E. Knuth . The Art of Computer Programming Volumn 1 , Fundamental Algorithms , Addison-Wesley , 1975 . Donald E. Knuth. The Art of Computer Programming Volumn 1, Fundamental Algorithms, Addison-Wesley, 1975."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2000.5340800"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.864008"},{"issue":"1","key":"e_1_2_1_33_1","article-title":"Advanced mobile phone service: The cellular concept","volume":"58","author":"MacDonald V.","year":"1979","unstructured":"V. MacDonald . Advanced mobile phone service: The cellular concept . Bell Systems Technical Journal , 58 ( 1 ), 1979 . V. MacDonald. Advanced mobile phone service: The cellular concept. Bell Systems Technical Journal, 58(1), 1979.","journal-title":"Bell Systems Technical Journal"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_9"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G"},{"key":"e_1_2_1_36_1","first-page":"71","volume-title":"I. Stojmenovi&$263;","author":"Narayanan L.","year":"2002","unstructured":"L. Narayanan . Channel assignment and graph multicoloring . In I. Stojmenovi&$263; , editor, Hand- book of Wireless Networks and Mobile Computing, pages 71 -- 94 . John Wiley &amp;Sons, 2002 . L. Narayanan. Channel assignment and graph multicoloring. In I. Stojmenovi&$263;, editor, Hand- book of Wireless Networks and Mobile Computing, pages 71--94. John Wiley&amp;Sons, 2002."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010067"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.02.002"},{"volume-title":"Proc. of the 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.","author":"Rouskas Angelos N.","key":"e_1_2_1_39_1","unstructured":"Angelos N. Rouskas , Dimitrios N. Skoutas . OVSF codes assignemnt and reassignment at the forward link OFW-CDMA 3G systems . In Proc. of the 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. Angelos N. Rouskas, Dimitrios N. Skoutas. OVSF codes assignemnt and reassignment at the forward link OFW-CDMA 3G systems. In Proc. of the 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.02.017"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.09.001"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1022630.1022645"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/26.380171"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1620491.1620508","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1620491.1620508","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:18:16Z","timestamp":1750249096000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1620491.1620508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,25]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9,25]]}},"alternative-id":["10.1145\/1620491.1620508"],"URL":"https:\/\/doi.org\/10.1145\/1620491.1620508","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2009,9,25]]},"assertion":[{"value":"2009-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}