{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:26Z","timestamp":1725544646255},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11672142_47","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"571-583","source":"Crossref","is-referenced-by-count":12,"title":["Generating Randomized Roundings 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":"47_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":"47_CR2","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1137\/S0097539702417511","volume":"32","author":"T. Asano","year":"2003","unstructured":"Asano, T., Katoh, N., Obokata, K., Tokuyama, T.: Matrix rounding under the \n                  \n                    \n                  \n                  $L\\sb p$\n                -discrepancy measure and its application to digital halftoning. SIAM J. Comput.\u00a032, 1423\u20131435 (2003)","journal-title":"SIAM J. Comput."},{"key":"47_CR3","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":"47_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF02591800","volume":"30","author":"J. Beck","year":"1984","unstructured":"Beck, J., Spencer, J.: Integral approximation sequences. Math. Programming\u00a030, 88\u201398 (1984)","journal-title":"Math. Programming"},{"key":"47_CR5","unstructured":"Doerr, B.: Non-independent randomized rounding. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 506\u2013507 (2003)"},{"key":"47_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":"47_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-540-31856-9_51","volume-title":"STACS 2005","author":"B. Doerr","year":"2005","unstructured":"Doerr, B.: Roundings respecting hard constraints. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 617\u2013628. Springer, Heidelberg (2005)"},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-45061-0_15","volume-title":"Automata, Languages and Programming","author":"R. Gandhi","year":"2003","unstructured":"Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Srinivasan, A.: An improved approximation algorithm for vertex cover with hard capacities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 164\u2013175. Springer, Heidelberg (2003)"},{"key":"47_CR9","doi-asserted-by":"crossref","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)","DOI":"10.1109\/SFCS.2002.1181955"},{"key":"47_CR10","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":"47_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":"47_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":"47_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":"47_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":"47_CR15","volume-title":"CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics","author":"J. Spencer","year":"1994","unstructured":"Spencer, J.: Ten lectures on the probabilistic method. In: CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial and Applied Mathematics, vol.\u00a064, SIAM, Philadelphia (1994)"},{"key":"47_CR16","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":"47_CR17","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":"47_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T07:45:50Z","timestamp":1552376750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11672142_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}