Dominance guarantees for above-average solutions
نویسندگان
چکیده
منابع مشابه
Dominance guarantees for above-average solutions
Gutin et al. [G. Gutin, A. Yeo, Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number, Discrete Applied Mathematics 119 (1–2) (2002) 107–116] proved that, in the ATSP problem, a tour of weight not exceeding the weight of an average tour is of dominance ratio at least 1/(n − 1) for all n 6= 6. (Tours with this property can be easily obtained.) In [N. Alon...
متن کاملCombinatorial Dominance Guarantees for Heuristic Algorithms
An f (n) dominance bound on a heuristic for some problem is a guarantee that the heuristic always returns a solution not worse than at least f (n) solutions. In this paper, we analyze several heuristics for Vertex Cover, Set Cover, and Knapsack for dominance bounds. In particular, we show that the well-known maximal matching heuristic of Vertex Cover provides an excellent dominance bound. We in...
متن کاملTemporal processing ability in above average and average readers.
In the present study, we compared the rapid visual and auditory temporal processing ability of above average and average readers. One hundred five undergraduates participated in various visual and auditory temporal tasks. The above average readers exhibited lower auditory and visual temporal resolution thresholds than did the average readers, but only the differences in the auditory tasks were ...
متن کاملParameterized Complexity of MaxSat above Average
In MaxSat, we are given a CNF formula F with n variables and m clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let r1, . . . , rm be the number of literals in the clauses of F . Then asat(F ) = ∑m i=1(1 − 2 −ri) is the expected number of clauses satisfied by a random truth assignment (the truth values to the variables are distributed uniformly and independ...
متن کاملSatisfiability of Ordering CSPs Above Average
We study the satisfiability of ordering constraint satisfaction problems (CSPs) above average. We show that for every k, the satisfiability above average of ordering CSPs of arity at most k is fixed-parameter tractable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2008
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2007.11.009