{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:22:48Z","timestamp":1742912568102,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_10","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"72-83","source":"Crossref","is-referenced-by-count":0,"title":["Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Bertoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Radicioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"9","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1109\/9.880644","volume":"45","author":"V.D. Blondel","year":"2000","unstructured":"Blondel, V.D., Gaubert, S., Tsitsiklis, J.N.: Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard. IEEE Trans. Automat. Control\u00a045(9), 1762\u20131765 (2000)","journal-title":"IEEE Trans. Automat. Control"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/15326349708807441","volume":"13","author":"M. Brilman","year":"1997","unstructured":"Brilman, M., Vincent, J.M.: Dynamics of synchronized parallel systems. Comm. Statist. Stochastic Models\u00a013(3), 605\u2013617 (1997)","journal-title":"Comm. Statist. Stochastic Models"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1287\/moor.23.2.305","volume":"23","author":"M. Brilman","year":"1998","unstructured":"Brilman, M., Vincent, J.-M.: On the estimation of the throughput for a class of stochastic resources sharing systems. Math. Oper. Res.\u00a023(2), 305\u2013321 (1998)","journal-title":"Math. Oper. Res."},{"key":"10_CR4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0079468","volume-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements","author":"P. Cartier","year":"1969","unstructured":"Cartier, P., Foata, D.: Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. Lecture Notes in Mathematics, vol.\u00a085. Springer-Verlag, Berlin Heidelberg (1969)"},{"issue":"12","key":"10_CR5","doi-asserted-by":"publisher","first-page":"2014","DOI":"10.1109\/9.478227","volume":"40","author":"S. Gaubert","year":"1995","unstructured":"Gaubert, S.: Performance evaluation of ( max ,\u2009+\u2009) automata. IEEE Trans. Automat. Control\u00a040(12), 2014\u20132025 (1995)","journal-title":"IEEE Trans. Automat. Control"},{"key":"10_CR6","series-title":"Publ. Newton Inst","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1017\/CBO9780511662508.009","volume-title":"Idempotency (Bristol, 1994)","author":"S. Gaubert","year":"1998","unstructured":"Gaubert, S., Mairesse, J.: Task resource models and ( max ,\u2009+\u2009) automata. In: Idempotency (Bristol, 1994). Publ. Newton Inst, vol.\u00a011, pp. 133\u2013144. Cambridge Univ. Press, Cambridge (1998)"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $n\\sp {1-\\epsilon}$. Acta Math.\u00a0182(1), 105\u2013142 (1999)","journal-title":"Acta Math."},{"issue":"1-3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0012-365X(03)00233-4","volume":"273","author":"D. Krob","year":"2003","unstructured":"Krob, D., Mairesse, J., Ioannis, M.: Computing the average parallelism in trace monoids. Discrete Math.\u00a0273(1-3), 131\u2013162 (2003) (EuroComb\u201901 Barcelona)","journal-title":"Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Technical Report DAIMI PB-78, Aarhus University, Comp. Science Depart. (July 1977)","key":"10_CR9","DOI":"10.7146\/dpb.v6i78.7691"},{"issue":"1-3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(92)90287-K","volume":"24","author":"N. Saheb","year":"1989","unstructured":"Saheb, N.: Concurrency measure in commutation monoids. Discrete Appl. Math.\u00a024(1-3), 223\u2013236 (1989) First Montreal Conference on Combinatorics and Computer Science, 1987","journal-title":"Discrete Appl. Math."},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/978-3-662-04166-6_72","volume-title":"Formal power series and algebraic combinatorics (Moscow, 2000)","author":"N. Saheb","year":"2000","unstructured":"Saheb, N., Zemmari, A.: Methods for computing the concurrency degree of commutation monoids. In: Formal power series and algebraic combinatorics (Moscow, 2000), pp. 731\u2013742. Springer, Berlin, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T20:18:38Z","timestamp":1675714718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}