691,178 research outputs found
Linear Problems and Linear Algorithms
AbstractUsing predicate logic, the concept of a linear problem is formalized. The class of linear problems is huge, diverse, complex, and important. Linear and randomized linear algorithms are formalized. For each linear problem, a linear algorithm is constructed that solves the problem and a randomized linear algorithm is constructed that completely solves it, that is, for any data of the problem, the output set of the randomized linear algorithm is identical to the solution set of the problem. We obtain a single machine, referred to as the Universal (Randomized) Linear Machine, which (completely) solves every instance of every linear problem. Conversely, for each randomized linear algorithm, a linear problem is constructed that the algorithm completely solves. These constructions establish a one-to-one and onto correspondence from equivalence classes of linear problems to equivalence classes of randomized linear algorithms.Our construction of (randomized) linear algorithms to (completely) solve linear problems as well as the algorithms themselves are based on Fourier Elimination and have superexponential complexity. However, there is no evidence that the inefficiency of our methods is unavoidable relative to the difficulty of the problem
Some recent results in the analysis of greedy algorithms for assignment problems
We survey some recent developments in the analysis of greedy algorithms for assignment and transportation problems. We focus on the linear programming model for matroids and linear assignment problems with Monge property, on general linear programs, probabilistic analysis for linear assignment and makespan minimization, and on-line algorithms for linear and non-linear assignment problems
Linear-Time FPT Algorithms via Network Flow
In the area of parameterized complexity, to cope with NP-Hard problems, we
introduce a parameter k besides the input size n, and we aim to design
algorithms (called FPT algorithms) that run in O(f(k)n^d) time for some
function f(k) and constant d. Though FPT algorithms have been successfully
designed for many problems, typically they are not sufficiently fast because of
huge f(k) and d. In this paper, we give FPT algorithms with small f(k) and d
for many important problems including Odd Cycle Transversal and Almost 2-SAT.
More specifically, we can choose f(k) as a single exponential (4^k) and d as
one, that is, linear in the input size. To the best of our knowledge, our
algorithms achieve linear time complexity for the first time for these
problems. To obtain our algorithms for these problems, we consider a large
class of integer programs, called BIP2. Then we show that, in linear time, we
can reduce BIP2 to Vertex Cover Above LP preserving the parameter k, and we can
compute an optimal LP solution for Vertex Cover Above LP using network flow.
Then, we perform an exhaustive search by fixing half-integral values in the
optimal LP solution for Vertex Cover Above LP. A bottleneck here is that we
need to recompute an LP optimal solution after branching. To address this
issue, we exploit network flow to update the optimal LP solution in linear
time.Comment: 20 page
Optimal Point Placement for Mesh Smoothing
We study the problem of moving a vertex in an unstructured mesh of
triangular, quadrilateral, or tetrahedral elements to optimize the shapes of
adjacent elements. We show that many such problems can be solved in linear time
using generalized linear programming. We also give efficient algorithms for
some mesh smoothing problems that do not fit into the generalized linear
programming paradigm.Comment: 12 pages, 3 figures. A preliminary version of this paper was
presented at the 8th ACM/SIAM Symp. on Discrete Algorithms (SODA '97). This
is the final version, and will appear in a special issue of J. Algorithms for
papers from SODA '9
- …