S. Porschen, On the Time Complexity of Rectangular Covering Problems in the Discrete Plane, Proceedings of 4th ICCSA 2004/CGA 2004, Lect. Notes in Comp. Sci., Vol. 3045, pp. 137-1465, 2004.S. Porschen. On the Time Complexity of Rectangular Covering Problems in the Dis- crete Plane . ...
Quiz sounds like something that can contain questions, because you can answer them. There can exist even algorithmic questions like “what’s the complexity of Dijkstra algorithm?” but problems request something like “write a code which solves this problem”. There is even a difference between ...
Maximizing earns or minimizing losses has always been a concern in engineering problems. For diverse fields of knowledge, the complexity of optimization problems increases as science and technology develop. Often, examples of engineering problems that might require an optimization approach are in energy ...
These results have numerous consequences in various fields, like parameterized complexity, exact and approximate algorithms on planar and H-minor-free graphs and exact algorithms on graphs of bounded degree. The constant c in our algorithms is in all cases small, and in several cases we are able...
Linear running time complexity with optimality gaps close to 1:对于MST和SSP问题,运行时间为 O(m) 在边数上是线性的。对于TSP和VRP,运行时间为 O(n) 在节点数上是线性的。 Generalization on graphs:从小的随机图推广到大的随机图,从一种类型的随机图推广到另一种类型的随机图,从随机图推广到现实世界图上...
Approximation complexity of min LNCS n掳3669, http://dx.doi.org/ This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical... H Aissi,C Bazgan,D Vanderpooten - 《Lecture Notes in Computer Science》 被引量: 58发表: 2005年...
Life presents us with problems of varying complexity. Yet, complexity is not accounted for in theories of human decision-making. Here we study instances of the knapsack problem, a discrete optimisation problem commonly encountered at all levels of cognition, from attention gating to intellectual disco...
In [14], a better algorithm is provided: the time-complexity is still O(n4), but it is much more efficient on r]]>Quadratic-time algorithmsreductionsStrong Exponential Time Hypothesistransitive closureWe analyze several quadratic-time solvable problems, and we show that...
This paper focuses on finite minimax problems with many functions, and their solution by means of exponential smoothing. We conduct run-time complexity and rate of convergence analysis of smoothing algorithms and compare them with those of SQP algorithms. We find that smoothing algorithms may have ...
Stearns, On the complexity of relational problems for finite state processes, in: International Colloquium on Automata Programming and Languages, ICALP, 1996, pp. 466–477; A. Rabinovich, Complexity of equivalence problems for concurrent systems of finite agents, Inform. and Comput. 127 (2) (...