Asymptotic Polynomial-Time Approximation ( APTAS ) and Randomized Approximation AlgorithmsEgeblad, Jens
Randomized algorithmsApproximation algorithmsMatroid constraintsIndividual size constraintsIn recent years,k-submodular functions have garnered significant attention due to their natural extension of submodular functions and their practical applications, such as influence maximization and sensor placement. Influence ...
All have their merits, but also their limitations, and need a large body of theory as their basis. A number of books for each one exist: books on complexity theory, others on approximation algorithms, heuristic approaches, parametrized complexity, and yet others on randomized algorithms. This ...
Based on these schemes, we present randomized approximation algorithms for STSP with γ-triangle inequality (ratio (1+γ/(1+3γ-4γ~2)+ε), asymmetric TSP (ATSP) with γ-triangle inequality (ratio 1/2 + (γ~3)/(1-3γ~2)+ε), STSP with weights one and two (ratio 4/3) and ...
where agents may misreport their preferences to manipulate the outcome. We first provide a strategyproof O(log (m/n))-approximation consecutive picking algorithm, and then improve the approximation ratio to O((log n)^0.5) by a r...
can be efficientlysapproximated to arbitrary precision using simulationsalgorithms =-=[20]-=-.sIn our case, we simulate in a singlespass N trials (path traversals) where nodes and edgessare included in the traversal with associatedsprobabilities.sThis is performed by storing asrandomized N-bi.....
Computers and Intractability 9.6 Randomized Algorithms 8.8 Algorithmic Game Theory 7.9 Programming Languages 8.9 Complexity and Approximation Strategies and Games 8.9 微积分教程 8.6 Distributed Algorithms 9.4 计算理论基础 9.0 我来说两句 短评 ··· ( 全部7 条 ) 热门 1 有用 ×○×~...
'This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of ...
Every tour begins at the depot, visits a subset of customers and returns to the depot without violating the capacity constraint. Randomized approximation algorithm achieving approximation guarantees of 2 for split-delivery VRPSD, and 3 for un-split delivery VRPSD are obtained....
The design and analysis of approximation algorithms include a mathematical proof confirming the quality of the generated solutions in the worst case, distinguishing them from heuristic approaches, which find reasonably good solutions, but do not provide any clear indication about the quality of the ...