18,578 research outputs found
Snapping Graph Drawings to the Grid Optimally
In geographic information systems and in the production of digital maps for
small devices with restricted computational resources one often wants to round
coordinates to a rougher grid. This removes unnecessary detail and reduces
space consumption as well as computation time. This process is called snapping
to the grid and has been investigated thoroughly from a computational-geometry
perspective. In this paper we investigate the same problem for given drawings
of planar graphs under the restriction that their combinatorial embedding must
be kept and edges are drawn straight-line. We show that the problem is NP-hard
for several objectives and provide an integer linear programming formulation.
Given a plane graph G and a positive integer w, our ILP can also be used to
draw G straight-line on a grid of width w and minimum height (if possible).Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016
Optimization problems involving the first Dirichlet eigenvalue and the torsional rigidity
We present some open problems and obtain some partial results for spectral
optimization problems involving measure, torsional rigidity and first Dirichlet
eigenvalue.Comment: 18 pages, 4 figure
Evaluation of Labeling Strategies for Rotating Maps
We consider the following problem of labeling points in a dynamic map that
allows rotation. We are given a set of points in the plane labeled by a set of
mutually disjoint labels, where each label is an axis-aligned rectangle
attached with one corner to its respective point. We require that each label
remains horizontally aligned during the map rotation and our goal is to find a
set of mutually non-overlapping active labels for every rotation angle so that the number of active labels over a full map rotation of
2 is maximized. We discuss and experimentally evaluate several labeling
models that define additional consistency constraints on label activities in
order to reduce flickering effects during monotone map rotation. We introduce
three heuristic algorithms and compare them experimentally to an existing
approximation algorithm and exact solutions obtained from an integer linear
program. Our results show that on the one hand low flickering can be achieved
at the expense of only a small reduction in the objective value, and that on
the other hand the proposed heuristics achieve a high labeling quality
significantly faster than the other methods.Comment: 16 pages, extended version of a SEA 2014 pape
Using Entropy-Based Methods to Study General Constrained Parameter Optimization Problems
In this letter we propose the use of physics techniques for entropy
determination on constrained parameter optimization problems. The main feature
of such techniques, the construction of an unbiased walk on energy space,
suggests their use on the quest for optimal solutions of an optimization
problem. Moreover, the entropy, and its associated density of states, give us
information concerning the feasibility of solutions.Comment: 10 pages, 3 figures, references correcte
Fine-Grained Complexity Analysis of Two Classic TSP Variants
We analyze two classic variants of the Traveling Salesman Problem using the
toolkit of fine-grained complexity. Our first set of results is motivated by
the Bitonic TSP problem: given a set of points in the plane, compute a
shortest tour consisting of two monotone chains. It is a classic
dynamic-programming exercise to solve this problem in time. While the
near-quadratic dependency of similar dynamic programs for Longest Common
Subsequence and Discrete Frechet Distance has recently been proven to be
essentially optimal under the Strong Exponential Time Hypothesis, we show that
bitonic tours can be found in subquadratic time. More precisely, we present an
algorithm that solves bitonic TSP in time and its bottleneck
version in time. Our second set of results concerns the popular
-OPT heuristic for TSP in the graph setting. More precisely, we study the
-OPT decision problem, which asks whether a given tour can be improved by a
-OPT move that replaces edges in the tour by new edges. A simple
algorithm solves -OPT in time for fixed . For 2-OPT, this is
easily seen to be optimal. For we prove that an algorithm with a runtime
of the form exists if and only if All-Pairs
Shortest Paths in weighted digraphs has such an algorithm. The results for
may suggest that the actual time complexity of -OPT is
. We show that this is not the case, by presenting an algorithm
that finds the best -move in time for
fixed . This implies that 4-OPT can be solved in time,
matching the best-known algorithm for 3-OPT. Finally, we show how to beat the
quadratic barrier for in two important settings, namely for points in the
plane and when we want to solve 2-OPT repeatedly.Comment: Extended abstract appears in the Proceedings of the 43rd
International Colloquium on Automata, Languages, and Programming (ICALP 2016
Statistical mechanics of random two-player games
Using methods from the statistical mechanics of disordered systems we analyze
the properties of bimatrix games with random payoffs in the limit where the
number of pure strategies of each player tends to infinity. We analytically
calculate quantities such as the number of equilibrium points, the expected
payoff, and the fraction of strategies played with non-zero probability as a
function of the correlation between the payoff matrices of both players and
compare the results with numerical simulations.Comment: 16 pages, 6 figures, for further information see
http://itp.nat.uni-magdeburg.de/~jberg/games.htm
Approximating the Maximum Overlap of Polygons under Translation
Let and be two simple polygons in the plane of total complexity ,
each of which can be decomposed into at most convex parts. We present an
-approximation algorithm, for finding the translation of ,
which maximizes its area of overlap with . Our algorithm runs in
time, where is a constant that depends only on and .
This suggest that for polygons that are "close" to being convex, the problem
can be solved (approximately), in near linear time
Entropy-based analysis of the number partitioning problem
In this paper we apply the multicanonical method of statistical physics on
the number-partitioning problem (NPP). This problem is a basic NP-hard problem
from computer science, and can be formulated as a spin-glass problem. We
compute the spectral degeneracy, which gives us information about the number of
solutions for a given cost and cardinality . We also study an extension
of this problem for partitions. We show that a fundamental difference on
the spectral degeneracy of the generalized () NPP exists, which could
explain why it is so difficult to find good solutions for this case. The
information obtained with the multicanonical method can be very useful on the
construction of new algorithms.Comment: 6 pages, 4 figure
Vertical ray shooting and computing depth orders of fat objects
We present new results for three problems dealing with a set of convex constant-complexity fat polyhedra in 3-space. (i) We describe a data structure for vertical ray shooting in that has query time and uses storage. (ii) We give an algorithm to compute in time a depth order on if it exists. (iii) We give an algorithm to verify in time whether a given order on is a valid depth order. All three results improve on previous results
Particle Dispersion on Rapidly Folding Random Hetero-Polymers
We investigate the dynamics of a particle moving randomly along a disordered
hetero-polymer subjected to rapid conformational changes which induce
superdiffusive motion in chemical coordinates. We study the antagonistic
interplay between the enhanced diffusion and the quenched disorder. The
dispersion speed exhibits universal behavior independent of the folding
statistics. On the other hand it is strongly affected by the structure of the
disordered potential. The results may serve as a reference point for a number
of translocation phenomena observed in biological cells, such as protein
dynamics on DNA strands.Comment: 4 pages, 4 figure
- …