{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:59:21Z","timestamp":1742954361399,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_51","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"617-628","source":"Crossref","is-referenced-by-count":4,"title":["Roundings Respecting Hard Constraints"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s101070100271","volume":"92","author":"S. Arora","year":"2002","unstructured":"Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program.\u00a092, 1\u201336 (2002)","journal-title":"Math. Program."},{"key":"51_CR2","unstructured":"Ageev, A., Sviridenko, M.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization (to appear); Also available from the authors\u2019 homepages"},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(81)90022-6","volume":"3","author":"J. Beck","year":"1981","unstructured":"Beck, J., Fiala, T.: \u201cInteger making\u201d theorems. Discrete Applied Mathematics\u00a03, 1\u20138 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"51_CR4","unstructured":"Doerr, B.: Lattice approximation and linear discrepancy of totally unimodular matrices. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 119\u2013125 (2001)"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S0963548303005662","volume":"12","author":"B. Doerr","year":"2003","unstructured":"Doerr, B., Srivastav, A.: Multicolour discrepancies. Combinatorics, Probability and Computing\u00a012, 365\u2013399 (2003)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"Ser. R-3","key":"51_CR6","first-page":"3","volume":"5","author":"D. de Werra","year":"1971","unstructured":"de Werra, D.: Equitable colorations of graphs. Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle\u00a05(Ser. R-3), 3\u20138 (1971)","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"key":"51_CR7","first-page":"1192","volume":"254","author":"A. Ghouila-Houri","year":"1962","unstructured":"Ghouila-Houri, A.: Caract\u00e9risation des matrices totalement unimodulaires. C.\u00a0R.\u00a0Acad. Sci. Paris\u00a0254, 1192\u20131194 (1962)","journal-title":"C.\u00a0R.\u00a0Acad. Sci. Paris"},{"key":"51_CR8","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding in bipartite graphs. In: Proc. IEEE Symposium on Foundations of Computer Science (FOCS), pp. 323\u2013332 (2002)"},{"key":"51_CR9","first-page":"19","volume-title":"Annual ACM Symposium on Theory of Computing (STOC)","author":"V. Guruswami","year":"1999","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Annual ACM Symposium on Theory of Computing (STOC), pp. 19\u201328. ACM, New York (1999)"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems, pp. 223\u2013246 (1956)","DOI":"10.1515\/9781400881987-014"},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01840353","volume":"2","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Leighton, F.T., Rivest, R.L., Thompson, C.D., Vazirani, U.V., Vazirani, V.V.: Global wire routing in two-dimensional arrays. Algorithmica\u00a02, 113\u2013129 (1987)","journal-title":"Algorithmica"},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/S0097539793250767","volume":"26","author":"A. Panconesi","year":"1997","unstructured":"Panconesi, A., Srinivasan, A.: Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Comput.\u00a026, 350\u2013368 (1997)","journal-title":"SIAM J. Comput."},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J.\u00a0Comput. Syst. Sci.\u00a037, 130\u2013143 (1988)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"51_CR14","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF01759035","volume":"6","author":"P. Raghavan","year":"1991","unstructured":"Raghavan, P., Thompson, C.D.: Multiterminal global routing: a deterministic approximation scheme. Algorithmica\u00a06, 73\u201382 (1991)","journal-title":"Algorithmica"},{"key":"51_CR16","volume-title":"Ten Lectures on the Probabilistic Method","author":"J. Spencer","year":"1987","unstructured":"Spencer, J.: Ten Lectures on the Probabilistic Method. SIAM, Philadelphia (1987)"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Distributions on level-sets with applications to approximations algorithms. In: Proc. 41th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 588\u2013597 (2001)","DOI":"10.1109\/SFCS.2001.959935"},{"key":"51_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1002\/(SICI)1098-2418(199601)8:1<27::AID-RSA2>3.0.CO;2-T","volume":"8","author":"A. Srivastav","year":"1996","unstructured":"Srivastav, A., Stangier, P.: Algorithmic Chernoff-Hoeffding inequalities in integer programming. Random Structures & Algorithms\u00a08, 27\u201358 (1996)","journal-title":"Random Structures & Algorithms"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T23:45:17Z","timestamp":1675899917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}