{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:26:44Z","timestamp":1771486004773,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238223","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"502-512","source":"Crossref","is-referenced-by-count":16,"title":["Switch scheduling via randomized edge coloring"],"prefix":"10.1109","author":[{"given":"G.","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"R.","family":"Motwani","sequence":"additional","affiliation":[]},{"given":"D.","family":"Shah","sequence":"additional","affiliation":[]},{"family":"An Zhu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"18","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"vizing","year":"1964","journal-title":"Metody Diskret Analiz"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665071"},{"key":"16","article-title":"Strictly non-blocking WDM cross-connects","author":"rasala","year":"0","journal-title":"Proceedings of SODA 2002"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793250767"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019350"},{"key":"11","article-title":"Scheduling algorithms for input-queued switches","author":"mckeown","year":"1995"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/211542.606546"},{"key":"3","article-title":"Cisco 12000 Gigabit Switch Router","year":"2000"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90209-E"},{"key":"1","article-title":"Applied probability and queues","author":"asmussen","year":"1987"},{"key":"10","article-title":"Achieving 100% throughput in an input-queued switch","author":"mckeown","year":"0","journal-title":"Proceedings of INFOCOM 1996"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019366"},{"key":"6","article-title":"Computers and intractability - A guide to the theory of NP-completeness","author":"garey","year":"1979"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832229"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170002"},{"key":"9","article-title":"Near-optimal, distributed edge coloring via the nibble method","author":"dubhashi","year":"0","journal-title":"Proceedings of ESA 1995"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199705)10:3<385::AID-RSA6>3.3.CO;2-3"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","location":"Cambridge, MA, USA","acronym":"SFCS-03"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238223.pdf?arnumber=1238223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T13:11:09Z","timestamp":1489410669000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238223\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238223","relation":{},"subject":[]}}