On a min-max problem of leo moser
نویسندگان
چکیده
منابع مشابه
On the max min vertex cover Problem
We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP-hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an n approximation ratio, while showing that unless P = ...
متن کاملA Min-max Problem on Roots of Unity
Abstract. The worst-case residual norms of the GMRES method for linear algebraic systems [3] can, in case of a normal matrix, be characterized by a min-max approximation problem on the matrix eigenvalues. In [2] we derive a lower bound on this min-max value (worst-case residual norm) for each step of the GMRES iteration. We conjecture that the lower bound and the min-max value agree up to a fac...
متن کاملA Problem of Leo Moser About Repeated Distances on the Sphere
PAUL ERD%: I was born on March 26, 1913. My parents were both mathematics teachers and I learned a great deal of elementary mathematics from them. I received my Ph.D. in 1934 with Professor L. Fejir. I was in Manchester with Professor Mordell from 1934-38 and from 1938 to 1954 I was in the United States. Since then I have constantly travelled around the world: Hungary, the Anglo-Saxon countries...
متن کاملThe Min-max Edge q-Coloring Problem
In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a colo...
متن کاملSolving Min-Max Vehicle Routing Problem
The present study is focused on the Min-Max Vehicle Routing Problem (MMVRP). According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; apply improved insertion method so as to improve the feasibility of the solution; retain the best selection so as to guard the diversity of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1968
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(68)80084-5