This book constitutes revised selected papers from the thoroughly refereed workshop proceedings of the 20th International Workshop on Approximation and Online Algorithms, WAOA 2022, which was colocated with ALGO 2022 and took place in Potsdam, Germany, in September 2022. The 12 …
"This book is the first in the literature to present the state of the art and some interesting and relevant applications of the Fuzzy Analytic Hierarchy Process (FAHP). The AHP is a conceptually and mathematically simple, easily implementable, yet extremely powerful tool for gro…
Fuzzy analytic hierarchy process
Fuzzy analytic hierarchy process
"This book is the first in the literature to present the state of the art and some interesting and relevant applications of the Fuzzy Analytic Hierarchy Process (FAHP). The AHP is a conceptually and mathematically simple, easily implementable, yet extremely powerful tool for gro…
This book constitutes the thoroughly refereed workshop post-proceedings of the 18th International Workshop on Approximation and Online Algorithms, WAOA 2019, held virtually in September 2020 as part of ALGO 2020. The 15 revised full papers presented this book were carefully revi…
In a typical optimization problem in a network, the goal is to optimize an incurred cost, while meeting a structural requirement. For example, in steiner tree problem, the structural requirement is to connect all the terminals and the incurred cost is the sum of the cost of all …
Embedding between metric spaces is a very powerful algorithmic tool and has been used for finding good approximation algorithms for several problems. In particular, embedding to an l1 norm has been used as the key step in an approximation algorithm for the sparsest cut problem. …
In this thesis, we present some approximation algorithms for the following clustering problems: Minimum Sum of Radii (MSR), Minimum Sum of Diameters (MSD), and Unsplittable Capacitated Facility Location (UCFL). Given a metric (V,d) and an integer k, we consider the problem of pa…
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterpart…
