{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:22Z","timestamp":1725493642346},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_15","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"130-138","source":"Crossref","is-referenced-by-count":4,"title":["The Structure and Number of Global Roundings of a Graph"],"prefix":"10.1007","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisao","family":"Tamaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"15_CR1","unstructured":"T. Asano, N. Katoh, K. Obokata, and T. Tokuyama, Matrix Rounding under the L p-Discrepancy Measure and Its Application to Digital Halftoning, Proc. 13th ACM-SIAM SODA (2002) pp. 896\u2013904."},{"key":"15_CR2","first-page":"241","volume":"7","author":"T. Asano","year":"2000","unstructured":"T. Asano, T. Matsui, and T. Tokuyama, Optimal Roundings of Sequences and Matrices, Nordic Journal of Computing 7 (2000) pp.241\u2013256. (Preliminary version in SWAT00).","journal-title":"Nordic Journal of Computing"},{"key":"15_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/3-540-45678-3_54","volume-title":"Proc. 12th ISAAC","author":"T. Asano","year":"2001","unstructured":"T. Asano and T. Tokuyama, How to Color a Checkerboard with a Given Distribution \u2014 Matrix Rounding Achieving Low 2 \u00d7 2 Discrepancy, Proc. 12th ISAAC, LNCS 2223 (2001) pp. 636\u2013648."},{"key":"15_CR4","unstructured":"J. Beck and V. T. S\u00f3s, Discrepancy Theory, in Handbook of Combinatorics Volume II (ed. T. Graham, M. Gr\u00f6tshel, and L. Lov\u00e1sz) 1995, Elsevier."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s. Modern Graph Theory, GTM 184, Springer-Verlag, 1998.","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"B. Chazelle, The Discrepancy Method: Randomness and Complexity, Princeton University, 2000.","DOI":"10.1017\/CBO9780511626371"},{"key":"15_CR7","unstructured":"B. Doerr, Lattice Approximation and Linear Discrepancy of Totally Unimodular Matrices, Proc. 12th ACM-SIAM SODA (2001) pp.119\u2013125."},{"key":"15_CR8","unstructured":"A. Hoffman and G. Kruskal, Integral Boundary Points of Convex Polyhedra, In Linear Inequalities and Related Systems (ed. W. Kuhn and A. Tucker) (1956) pp. 223\u2013246."},{"key":"15_CR9","unstructured":"J. Jansson and T. Tokuyama, Semi-Balanced Coloring of Graphs-2-Colorings Based on a Relaxed Discrepancy Condition, Submitted."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek, Geometric Discrepancy, Algorithms and Combinatorics 18, Springer Verlag 1999.","DOI":"10.1007\/978-3-642-03942-3"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"H. Niederreiter, Random Number Generations and Quasi Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Math., SIAM, 1992.","DOI":"10.1137\/1.9781611970081"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"J. Pach and P. Agarwal, Combinatorial Geometry, John-Wiley & Sons, 1995.","DOI":"10.1002\/9781118033203"},{"key":"15_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-48224-5_14","volume-title":"Proc. 28th ICALP","author":"K. Sadakane","year":"2001","unstructured":"K. Sadakane, N. Takki-Chebihi, and T. Tokuyama, Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence, Proc. 28th ICALP, LNCS 2076 (2001) pp. 166\u2013177."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:09:04Z","timestamp":1556935744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}