{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:49:55Z","timestamp":1725511795363},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_38","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T19:41:23Z","timestamp":1179949283000},"page":"441-452","source":"Crossref","is-referenced-by-count":3,"title":["Randomly Rounding Rationals with Cardinality Constraints and Derandomizations"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/B:JOCO.0000038913.96607.c2","volume":"8","author":"A.A. Ageev","year":"2004","unstructured":"Ageev, A.A., Sviridenko, M.I.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J. Comb. Optim.\u00a08, 307\u2013328 (2004)","journal-title":"J. Comb. Optim."},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/j.jco.2005.05.002","volume":"21","author":"B. Doerr","year":"2005","unstructured":"Doerr, B., Gnewuch, M., Srivastav, A.: Bounds and constructions for the star-discrepancy via \u03b4-covers. Journal of Complexity\u00a021, 691\u2013709 (2005)","journal-title":"Journal of Complexity"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11944836_20","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"B. Doerr","year":"2006","unstructured":"Doerr, B., Klein, C.: Unbiased rounding of rational matrices. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 200\u2013211. Springer, Heidelberg (2006)"},{"key":"38_CR4","unstructured":"Doerr, B.: Non-independent randomized rounding. In: SODA 2003, pp. 506\u2013507 (2003)"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ipl.2004.07.002","volume":"92","author":"B. Doerr","year":"2004","unstructured":"Doerr, B.: Global roundings of sequences. Information Processing Letters\u00a092, 113\u2013116 (2004)","journal-title":"Information Processing Letters"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/S0097539703430154","volume":"34","author":"B. Doerr","year":"2004","unstructured":"Doerr, B.: Nonindependent randomized rounding and an application to digital halftoning. SIAM Journal on Computing\u00a034, 299\u2013317 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/11672142_47","volume-title":"STACS 2006","author":"B. Doerr","year":"2006","unstructured":"Doerr, B.: Generating randomized roundings with cardinality constraints and derandomizations. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 571\u2013583. Springer, Heidelberg (2006)"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"de Werra, D.: Equitable colorations of graphs. Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle 5(Ser. R-3), 3\u20138 (1971)","DOI":"10.1051\/m2an\/197105R300031"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jcss.2005.06.004","volume":"72","author":"R. Gandhi","year":"2006","unstructured":"Gandhi, R., et al.: An improved approximation algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci.\u00a072, 16\u201333 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Gandhi, R., et al.: Dependent rounding in bipartite graphs. In: FOCS 2002, pp. 323\u2013332 (2002)","DOI":"10.1109\/SFCS.2002.1181955"},{"key":"38_CR11","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":"38_CR12","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":"38_CR13","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":"38_CR14","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":"38_CR15","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Distributions on level-sets with applications to approximations algorithms. In: FOCS 2001, pp. 588\u2013597 (2001)","DOI":"10.1109\/SFCS.2001.959935"},{"key":"38_CR16","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"},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-48224-5_14","volume-title":"Automata, Languages and Programming","author":"K. Sadakane","year":"2001","unstructured":"Sadakane, K., Takki-Chebihi, N., Tokuyama, T.: Combinatorics and algorithms on low-discrepancy roundings of a real sequence. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 166\u2013177. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:32:09Z","timestamp":1620001929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_38","relation":{},"subject":[]}}