{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T05:23:47Z","timestamp":1750397027942},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592497"},{"type":"electronic","value":"9783319592503"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59250-3_28","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T13:04:39Z","timestamp":1495544679000},"page":"343-354","source":"Crossref","is-referenced-by-count":8,"title":["Minimum Birkhoff-von Neumann Decomposition"],"prefix":"10.1007","author":[{"given":"Janardhan","family":"Kulkarni","sequence":"first","affiliation":[]},{"given":"Euiwoong","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Barman, S.: Approximating nash equilibria and dense bipartite subgraphs via an approximate version of caratheodory\u2019s theorem. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pp. 361\u2013369. ACM (2015)","DOI":"10.1145\/2746539.2746566"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Bojja, S., Mohammad Alizadeh, V., Viswanath, P.: Costly circuits, submodular schedules and approximate carath\u00e9odory theorems. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pp. 75\u201388. ACM (2016)","DOI":"10.1145\/2964791.2901479"},{"issue":"2","key":"28_CR3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.4153\/CMB-1982-026-3","volume":"25","author":"RA Brualdi","year":"1982","unstructured":"Brualdi, R.A.: Notes on the birkhoff algorithm for doubly stochastic matrices. Can. Math. Bull. 25(2), 191\u2013199 (1982)","journal-title":"Can. Math. Bull."},{"issue":"2","key":"28_CR4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0097-3165(77)90051-6","volume":"22","author":"RA Brualdi","year":"1977","unstructured":"Brualdi, R.A., Gibson, P.M.: Convex polyhedra of doubly stochastic matrices. I. Applications of the permanent function. J. Comb. Theor. Ser. A 22(2), 194\u2013230 (1977)","journal-title":"J. Comb. Theor. Ser. A"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Chang, C.-S., Chen, W.-J., Huang, H.-Y.: On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann. In: Seventh International Workshop on Quality of Service, IWQoS 1999, pp. 79\u201386. IEEE (1999)","DOI":"10.1109\/IWQOS.1999.766481"},{"issue":"2","key":"28_CR6","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/TNET.2013.2253120","volume":"22","author":"K Chen","year":"2014","unstructured":"Chen, K., Singla, A., Singh, A., Ramachandran, K., Lei, X., Zhang, Y., Wen, X., Chen, Y.: Osa: an optical switching architecture for data center networks with unprecedented flexibility. IEEE\/ACM Trans. Netw. 22(2), 498\u2013511 (2014)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.laa.2016.02.023","volume":"497","author":"F Dufoss\u00e9","year":"2016","unstructured":"Dufoss\u00e9, F., U\u00e7ar, B.: Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices. Linear Algebra Appl. 497, 108\u2013115 (2016)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"28_CR8","first-page":"609","volume":"10","author":"P Erdos","year":"1975","unstructured":"Erdos, P., Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Infinite Finite Sets 10(2), 609\u2013627 (1975)","journal-title":"Infinite Finite Sets"},{"issue":"4","key":"28_CR9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/1851275.1851223","volume":"40","author":"N Farrington","year":"2010","unstructured":"Farrington, N., Porter, G., Radhakrishnan, S., Hajabdolali Bazzaz, H., Subramanya, V., Fainman, Y., Papen, G., Vahdat, A.: Helios: a hybrid electrical\/optical switch architecture for modular data centers. ACM SIGCOMM Comput. Commun. Rev. 40(4), 339\u2013350 (2010)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Ghobadi, M., Mahajan, R., Phanishayee, A., Devanur, N., Kulkarni, J., Ranade, G., Blanche, P.-A., Rastegarfar, H., Glick, M., Kilper, D.: Projector: agile reconfigurable data center interconnect. In: Proceedings of the Conference on ACM SIGCOMM Conference, pp. 216\u2013229. ACM (2016)","DOI":"10.1145\/2934872.2934911"},{"issue":"4","key":"28_CR11","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Liu, H., Mukerjee, M.K., Li, C., Feltman, N., Papen, G., Savage, S., Seshan, S., Voelker, G.M., Andersen, D.G., Kaminsky, M., et al.: Scheduling techniques for hybrid circuit\/packet networks. In: ACM CoNEXT (2015)","DOI":"10.1145\/2716281.2836126"},{"key":"28_CR13","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"2009","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, vol. 367. American Mathematical Soc., Providence (2009)"},{"issue":"1","key":"28_CR14","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1093\/qmath\/10.1.296","volume":"10","author":"M Marcus","year":"1959","unstructured":"Marcus, M., Ree, R.: Diagonals of doubly stochastic matrices. Q. J. Math. 10(1), 296\u2013302 (1959)","journal-title":"Q. J. Math."},{"key":"28_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry, vol. 108. Springer, New York (2002)"},{"issue":"2","key":"28_CR16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1667053.1667060","volume":"57","author":"RA Moser","year":"2010","unstructured":"Moser, R.A., Tardos, G.: A constructive proof of the general Lov\u00e1sz local lemma. J. ACM (JACM) 57(2), 11 (2010)","journal-title":"J. ACM (JACM)"},{"key":"28_CR17","volume-title":"Randomized Algorithms","author":"R Motwani","year":"2010","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Chapman & Hall\/CRC, Boca Raton (2010)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Porter, G., Strong, R., Farrington, N., Forencich, A., Chen-Sun, P., Rosing, T., Fainman, Y., Papen, G., Vahdat, A.: Integrating microsecond circuit switching into the data center, vol. 43. ACM (2013)","DOI":"10.1145\/2486001.2486007"},{"issue":"7","key":"28_CR19","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret. Analiz 3(7), 25\u201330 (1964)","journal-title":"Diskret. Analiz"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Wang, G., Andersen, D.G., Kaminsky, M., Konstantina Papagiannaki, T.S., Ng, M.K., Ryan, M.: c-through: part-time optics in data centers. In: ACM SIGCOMM Computer Communication Review, vol. 40, pp. 327\u2013338. ACM (2010)","DOI":"10.1145\/1851275.1851222"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59250-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T23:50:12Z","timestamp":1569369012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59250-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592497","9783319592503"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59250-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}