Download or read book Approximation Algorithms for Scheduling and Fair Allocations written by Yihao Zhang and published by . This book was released on 2022 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this thesis, we will have discussions on two main topics, max-min allocation and schedulingjobs with precedent constraints on machines with communication delays. New approximation algorithms are given in Chapter 2, 4 and 5, where linear programming plays a fairly important role on algorithm designs, while Chapter 3 contains partial results on the general max-min allocation. The Santa Claus problem is also known as the restricted max-min fair allocation. In this problem, Santa Claus has a set of gifts, and he wants to distribute them among a set of children so that the least happy child is made as happy as possible. Here, the value that a child i has for a present j is of the form pij [is an element of] {0, pj}. Based on a modification of Haxell's hypergraph matching argument, a polynomial time algorithm by Annamalai et al. gives a 12.33-approximation. In joint work with Sami Davies and Thomas Rothvoss, a matroid version of the Santa Claus problem is introduced. The algorithm is based on Haxell's augmenting tree, but with the introduction of the matroid structure. Our result can then be used as a blackbox to obtain a (4 + [epsilon])-approximation for Santa Claus, comparing against a natural, compact LP. A recent work of Cheng and Mao [CM19] also gets the factor (4 + [epsilon]). On the second half, we first consider the classic problem of scheduling jobs with precedence constraints on identical machines to minimize makespan, in the presence of communication delays. In this setting, denoted by P | prec, c | Cmax, if two dependent jobs are scheduled on different machines, then at least c units of time must pass between their executions. Despite its relevance to many applications, the best known approximation ratio was O(c), whereas Graham's greedy list scheduling algorithm already gives a (c + 1)-approximation in that setting. An outstanding open problem in the top-10 list by Schuurman and Woeginger and its recent update by Bansal asks whether there exists a constant-factor approximation algorithm. In joint work with Sami Davies, Janardhan Kulkarni, Thomas Rothvoss and Jakub Tarnawski, we give a polynomial-time O(log c · log m)-approximation algorithm for this problem, where m is the number of machines and c is the communication delay. Our approach is based on a Sherali-Adams lift of a linear programming relaxation and a randomized clustering of the semimetric space induced by this lift. Finally, a more general version of this problem is considered in Chapter 5, to minimize the weighted sum of completion times on related machines, denoted by Q | prec, c | wjCj . Our main result is an O(log4 n)-approximation algorithm for the problem. As a byproduct of our result, we also obtain an O(log3 n)-approximation algorithm for the problem of minimizing makespan Q | prec, c | Cmax, which improves upon the O(log5 n/ log log n)-approximation algorithm due to a recent work of Maiti et al. [MRS+20].
Download or read book Approximation and Online Algorithms written by Thomas Erlebach and published by Springer Science & Business Media. This book was released on 2006-02-13 with total page 357 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Approximation and Online Algorithms, held in Palma de in October 2005. The 26 revised full papers presented were carefully reviewed and selected from 68 submissions. Topics addressed by the workshop include algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, and mechanism design.
Download or read book Handbook of Scheduling written by Joseph Y-T. Leung and published by CRC Press. This book was released on 2004-04-27 with total page 1215 pages. Available in PDF, EPUB and Kindle. Book excerpt: This handbook provides full coverage of the most recent and advanced topics in scheduling, assembling researchers from all relevant disciplines to facilitate new insights. Presented in six parts, these experts provides introductory material, complete with tutorials and algorithms, then examine classical scheduling problems. Part 3 explores scheduling models that originate in areas such as computer science, operations research. The following section examines scheduling problems that arise in real-time systems. Part 5 discusses stochastic scheduling and queueing networks, and the final section discusses a range of applications in a variety of areas, from airlines to hospitals.
Download or read book Approximation Algorithms for Resource Scheduling and Allocation Problems written by Michael Beder and published by . This book was released on 2012 with total page 43 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Approximation and Online Algorithms written by Jochen Koenemann and published by Springer Nature. This book was released on 2022-01-01 with total page 286 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed workshop post-proceedings of the 19th International Workshop on Approximation and Online Algorithms, WAOA 2021, held in September 2021. Due to COVID-19 pandemic the conference was held virtually. The 16 revised full papers presented in this book were carefully reviewed and selected from 31 submissions. The papers focus on the design and analysis of algorithms for online and computationally hard problems.
Download or read book Designing Scheduling Algorithms Via a Mathematical Perspective written by Sami Davies and published by . This book was released on 2021 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: This document will discuss three problems that I worked on during my Ph.D. Chapter 2 contains my work on the Santa Claus problem, and Chapters 3 and 4 contain my work on scheduling with precedence constraints and communication delays. New algorithms for scheduling and resource allocation problems have far reaching implications, as problems in scheduling and resource allocation are a foundational playground for studying computational hardness and are practically relevant. In the Santa Claus problem, Santa has a set of gifts, and he wants to distribute them among a set of children so that the least happy child is as happy as possible. Child i has value pij for present j, where pij is in { 0,pj}. A modification of Haxell's hypergraph matching argument by Annamalai, Kalaitzis, and Svensson gives a 12.33-approximation algorithm for the problem. In joint work with Thomas Rothvoss and Yihao Zhang, we introduce a matroid version of the Santa Claus problem. While our algorithm is also based on the augmenting tree by Haxell, the introduction of the matroid structure allows us to solve a more general problem with cleaner methods. Using our result from the matroid version of the problem, we obtain a (4+epsilon) approximation algorithm for Santa Claus. In scheduling theory, one of the most poorly understood, yet practically interesting, models is scheduling in the presence of communication delays. Here, if two jobs are dependent and scheduled on different machines, then at least c units of time must pass between their executions. Even for the special case where an unlimited number of identical machines are available, the best known approximation ratio for minimizing makespan is O(c). An outstanding open problem in the top-10 list by Schuurman and Woeginger (and its recent update by Bansal) asks whether there exists a constant-factor approximation algorithm. In joint work with Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, and Yihao Zhang, we prove a O(log c · log m)-approximation algorithm for the problem of minimizing makespan on m identical machines; this work is presented in Chapter 3. Our approach is based on a Sherali-Adams lift of a linear programming relaxationand a randomized clustering of the semimetric space induced by this lift. We extend our work to the related machines setting and study the objectives of minimizing makespan and minimizing the weighted sum of completion times. Here, we also obtain polylogarithmic approximation algorithms, and these results are presented in Chapter 4.
Download or read book On line and Off line Approximation Algorithms for Various Resource Allocation and Scheduling Problems and for the Multiway Cut Problem written by Ari Freund and published by . This book was released on 2002 with total page 79 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Computing and Combinatorics written by Joachim Gudmundsson and published by Springer. This book was released on 2012-08-14 with total page 617 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization.
Download or read book Approximation Algorithms for Scheduling with Reservations written by Florian Diedrich and published by . This book was released on 2008 with total page 46 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Algorithms ESA 2011 written by Camil Demetrescu and published by Springer. This book was released on 2011-08-31 with total page 832 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbrücken, Germany, in September 2011 in the context of the combined conference ALGO 2011. The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems.
Download or read book Approximation Algorithms for Problems in Sequencing Scheduling and Communication Network Design written by David Bernard Shmoys and published by . This book was released on 1984 with total page 184 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Approximation Randomization and Combinatorial Optimization Algorithms and Techniques written by Moses Charikar and published by Springer. This book was released on 2007-08-28 with total page 636 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more.
Download or read book Approximation Algorithms for Some P complete Scheduling Problems written by Chul Eun Kim and published by . This book was released on 1975 with total page 234 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Approximation Randomization and Combinatorial Optimization Algorithms and Techniques written by Ashish Goel and published by Springer. This book was released on 2008-08-28 with total page 614 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains the papers presented at the 11th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM 2008), which took place concurrently at the MIT (M- sachusetts Institute of Technology) in Boston, USA, during August 25–27, 2008. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 11th in the series after Aalborg (1998), Berkeley (1999), Saarbru ̈cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 12th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). Topics of interest for APPROX and RANDOM are: design and analysis of - proximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game t- ory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and - beddings, error-correcting codes, average-case analysis, property testing, com- tational learning theory, and other applications of approximation and randomness.
Download or read book Approximation Algorithms for Problems in Scheduling with Set ups written by Srikrishnan Divakaran and published by . This book was released on 2001 with total page 136 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Advanced Contemporary Control written by Andrzej Bartoszewicz and published by Springer Nature. This book was released on 2020-06-24 with total page 1560 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents the proceedings of the 20th Polish Control Conference. A triennial event that was first held in 1958, the conference successfully combines its long tradition with a modern approach to shed light on problems in control engineering, automation, robotics and a wide range of applications in these disciplines. The book presents new theoretical results concerning the steering of dynamical systems, as well as industrial case studies and worked solutions to real-world problems in contemporary engineering. It particularly focuses on the modelling, identification, analysis and design of automation systems; however, it also addresses the evaluation of their performance, efficiency and reliability. Other topics include fault-tolerant control in robotics, automated manufacturing, mechatronics and industrial systems. Moreover, it discusses data processing and transfer issues, covering a variety of methodologies, including model predictive, robust and adaptive techniques, as well as algebraic and geometric methods, and fractional order calculus approaches. The book also examines essential application areas, such as transportation and autonomous intelligent vehicle systems, robotic arms, mobile manipulators, cyber-physical systems, electric drives and both surface and underwater marine vessels. Lastly, it explores biological and medical applications of the control-theory-inspired methods.
Download or read book Combinatorial Optimization and Applications written by Ding-Zhu Du and published by Springer. This book was released on 2009-06-18 with total page 554 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009. The 50 revised full papers were carefully reviewed and selected from 103 submissions. The papers feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
