{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:40:56Z","timestamp":1725536456141},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036842"},{"type":"electronic","value":"9783642036859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03685-9_12","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T22:39:51Z","timestamp":1250807991000},"page":"149-162","source":"Crossref","is-referenced-by-count":8,"title":["Scheduling with Outliers"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravishankar","family":"Krishnaswamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Segev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"LNCS","volume-title":"Lectures on Proof Verification and Approximation Algorithms","year":"1998","unstructured":"Mayr, E.W., Pr\u00f6mel, H.J., Steger, A. (eds.): Dagstuhl Seminar 1997. LNCS, vol.\u00a01367. Springer, Heidelberg (1998)"},{"key":"12_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-39658-1_7","volume-title":"Algorithms - ESA 2003","author":"N. Bansal","year":"2003","unstructured":"Bansal, N., Blum, A., Chawla, S., Dhamdhere, K.: Scheduling for flow-time with admission control. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 43\u201354. Springer, Heidelberg (2003)"},{"key":"12_CR3","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. In: SODA 1996, pp. 95\u2013103 (1996)"},{"key":"12_CR4","unstructured":"Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: SODA 2000, pp. 106\u2013115 (2000)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Khuller, S.: A robust maximum completion time measure for scheduling. In: SODA 2006, pp. 324\u2013333 (2006)","DOI":"10.1145\/1109557.1109594"},{"key":"12_CR6","unstructured":"Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA 2001, pp. 642\u2013651 (2001)"},{"key":"12_CR7","unstructured":"Chen, K.: A constant factor approximation algorithm for k-median clustering with outliers. In: SODA 2008, pp. 826\u2013835 (2008)"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10107-003-0479-2","volume":"100","author":"F.A. Chudak","year":"2004","unstructured":"Chudak, F.A., Roughgarden, T., Williamson, D.P.: Approximate k-msts and k-steiner trees via the primal-dual method and lagrangean relaxation. Mathematical Programming\u00a0100(2), 411\u2013421 (2004)","journal-title":"Mathematical Programming"},{"key":"12_CR9","series-title":"LNCS","first-page":"175","volume-title":"Algorithms - ESA \u201998","author":"D.W. Engels","year":"1998","unstructured":"Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 175\u2013191. Springer, Heidelberg (1998)"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"L. Epstein","year":"2002","unstructured":"Epstein, L., Noga, J., Woeginger, G.J.: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters\u00a030(6), 415\u2013420 (2002)","journal-title":"Operations Research Letters"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Garg, N.: Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In: STOC 2005, pp. 396\u2013402 (2005)","DOI":"10.1145\/1060590.1060650"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/11786986_17","volume-title":"Automata, Languages and Programming","author":"N. Garg","year":"2006","unstructured":"Garg, N., Kumar, A.: Better algorithms for minimizing average flow-time on related machines. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 181\u2013190. Springer, Heidelberg (2006)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Garg, N., Kumar, A.: Minimizing average flow-time: Upper and lower bounds. In: FOCS 2007, pp. 603\u2013613 (2007)","DOI":"10.1109\/FOCS.2007.52"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Golovin, D., Nagarajan, V., Singh, M.: Approximating the k-multicut problem. In: SODA 2006, pp. 621\u2013630 (2006)","DOI":"10.1145\/1109557.1109625"},{"key":"12_CR15","unstructured":"Guha, S., Munagala, K.: Model-driven optimization using adaptive probes. In: SODA 2007, pp. 308\u2013317 (2007)"},{"key":"12_CR16","unstructured":"Hall, L.A., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line algorithms. In: SODA 1996, pp. 142\u2013151 (1996)"},{"issue":"2-3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H. Hoogeveen","year":"2003","unstructured":"Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. Mathematical Programming, Ser. B\u00a094(2-3), 361\u2013374 (2003)","journal-title":"Mathematical Programming, Ser. B"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM\u00a048(2), 274\u2013296 (2001)","journal-title":"Journal of the ACM"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/11841036_43","volume-title":"Algorithms \u2013 ESA 2006","author":"J. K\u00f6nemann","year":"2006","unstructured":"K\u00f6nemann, J., Parekh, O., Segev, D.: A unified approach to approximating partial covering problems. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 468\u2013479. Springer, Heidelberg (2006)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: STOC 1997, pp. 110\u2013119 (1997)","DOI":"10.1145\/258533.258562"},{"issue":"1-3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2006.09.018","volume":"369","author":"A. Levin","year":"2006","unstructured":"Levin, A., Segev, D.: Partial multicuts in trees. Theoretical Computer Science\u00a0369(1-3), 384\u2013395 (2006)","journal-title":"Theoretical Computer Science"},{"key":"12_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/11538462_16","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"J. Mestre","year":"2005","unstructured":"Mestre, J.: A primal-dual approximation algorithm for partial vertex cover: making educated guesses. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 182\u2013191. Springer, Heidelberg (2005)"},{"key":"12_CR24","unstructured":"Mestre, J.: Lagrangian relaxation and partial cover (extended abstract). In: STACS 2008, pp. 539\u2013550 (2008)"},{"issue":"4","key":"12_CR25","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/S0895480199357078","volume":"15","author":"A.S. Schulz","year":"2002","unstructured":"Schulz, A.S., Skutella, M.: Scheduling unrelated machines by randomized rounding. SIAM Journal on Discrete Mathematics\u00a015(4), 450\u2013469 (2002)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"12_CR26","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"S.S. Seiden","year":"2001","unstructured":"Seiden, S.S.: Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science\u00a0262(1), 437\u2013458 (2001)","journal-title":"Theoretical Computer Science"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Mathematical Programming\u00a062, 461\u2013474 (1993)","journal-title":"Mathematical Programming"},{"issue":"2","key":"12_CR28","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M. Skutella","year":"2001","unstructured":"Skutella, M.: Convex quadratic and semidefinite programming relaxations in scheduling. Journal of the ACM\u00a048(2), 206\u2013242 (2001)","journal-title":"Journal of the ACM"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Faces for a linear inequality in 0-1 variables. Mathematical Programming\u00a08, 165\u2013178 (1975)","journal-title":"Mathematical Programming"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03685-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:33:55Z","timestamp":1558481635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03685-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036842","9783642036859"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03685-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}