3,023 research outputs found
On Solving Travelling Salesman Problem with Vertex Requisitions
We consider the Travelling Salesman Problem with Vertex Requisitions, where
for each position of the tour at most two possible vertices are given. It is
known that the problem is strongly NP-hard. The proposed algorithm for this
problem has less time complexity compared to the previously known one. In
particular, almost all feasible instances of the problem are solvable in O(n)
time using the new algorithm, where n is the number of vertices. The developed
approach also helps in fast enumeration of a neighborhood in the local search
and yields an integer programming model with O(n) binary variables for the
problem.Comment: To appear in Yugoslav Journal of Operations Researc
Non-optimality of the Greedy Algorithm for subspace orderings in the method of alternating projections
The method of alternating projections involves projecting an element of a
Hilbert space cyclically onto a collection of closed subspaces. It is known
that the resulting sequence always converges in norm and that one can obtain
estimates for the rate of convergence in terms of quantities describing the
geometric relationship between the subspaces in question, namely their pairwise
Friedrichs numbers. We consider the question of how best to order a given
collection of subspaces so as to obtain the best estimate on the rate of
convergence. We prove, by relating the ordering problem to a variant of the
famous Travelling Salesman Problem, that correctness of a natural form of the
Greedy Algorithm would imply that , before presenting a
simple example which shows that, contrary to a claim made in the influential
paper [Kayalar-Weinert, Math. Control Signals Systems, vol. 1(1), 1988], the
result of the Greedy Algorithm is not in general optimal. We go on to establish
sharp estimates on the degree to which the result of the Greedy Algorithm can
differ from the optimal result. Underlying all of these results is a
construction which shows that for any matrix whose entries satisfy certain
natural assumptions it is possible to construct a Hilbert space and a
collection of closed subspaces such that the pairwise Friedrichs numbers
between the subspaces are given precisely by the entries of that matrix.Comment: To appear in Results in Mathematic
Families with infants: a general approach to solve hard partition problems
We introduce a general approach for solving partition problems where the goal
is to represent a given set as a union (either disjoint or not) of subsets
satisfying certain properties. Many NP-hard problems can be naturally stated as
such partition problems. We show that if one can find a large enough system of
so-called families with infants for a given problem, then this problem can be
solved faster than by a straightforward algorithm. We use this approach to
improve known bounds for several NP-hard problems as well as to simplify the
proofs of several known results.
For the chromatic number problem we present an algorithm with
time and exponential space for graphs of average
degree . This improves the algorithm by Bj\"{o}rklund et al. [Theory Comput.
Syst. 2010] that works for graphs of bounded maximum (as opposed to average)
degree and closes an open problem stated by Cygan and Pilipczuk [ICALP 2013].
For the traveling salesman problem we give an algorithm working in
time and polynomial space for graphs of average
degree . The previously known results of this kind is a polyspace algorithm
by Bj\"{o}rklund et al. [ICALP 2008] for graphs of bounded maximum degree and
an exponential space algorithm for bounded average degree by Cygan and
Pilipczuk [ICALP 2013].
For counting perfect matching in graphs of average degree~ we present an
algorithm with running time and polynomial
space. Recent algorithms of this kind due to Cygan, Pilipczuk [ICALP 2013] and
Izumi, Wadayama [FOCS 2012] (for bipartite graphs only) use exponential space.Comment: 18 pages, a revised version of this paper is available at
http://arxiv.org/abs/1410.220
- …