340 research outputs found
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design
R. Lavy and C. Swamy (FOCS 2005, J. ACM 2011) introduced a general method for
obtaining truthful-in-expectation mechanisms from linear programming based
approximation algorithms. Due to the use of the Ellipsoid method, a direct
implementation of the method is unlikely to be efficient in practice. We
propose to use the much simpler and usually faster multiplicative weights
update method instead. The simplification comes at the cost of slightly weaker
approximation and truthfulness guarantees
Planar Embeddings with Small and Uniform Faces
Motivated by finding planar embeddings that lead to drawings with favorable
aesthetics, we study the problems MINMAXFACE and UNIFORMFACES of embedding a
given biconnected multi-graph such that the largest face is as small as
possible and such that all faces have the same size, respectively.
We prove a complexity dichotomy for MINMAXFACE and show that deciding whether
the maximum is at most is polynomial-time solvable for and
NP-complete for . Further, we give a 6-approximation for minimizing
the maximum face in a planar embedding. For UNIFORMFACES, we show that the
problem is NP-complete for odd and even . Moreover, we
characterize the biconnected planar multi-graphs admitting 3- and 4-uniform
embeddings (in a -uniform embedding all faces have size ) and give an
efficient algorithm for testing the existence of a 6-uniform embedding.Comment: 23 pages, 5 figures, extended version of 'Planar Embeddings with
Small and Uniform Faces' (The 25th International Symposium on Algorithms and
Computation, 2014
Recognizing hyperelliptic graphs in polynomial time
Recently, a new set of multigraph parameters was defined, called
"gonalities". Gonality bears some similarity to treewidth, and is a relevant
graph parameter for problems in number theory and multigraph algorithms.
Multigraphs of gonality 1 are trees. We consider so-called "hyperelliptic
graphs" (multigraphs of gonality 2) and provide a safe and complete sets of
reduction rules for such multigraphs, showing that for three of the flavors of
gonality, we can recognize hyperelliptic graphs in O(n log n+m) time, where n
is the number of vertices and m the number of edges of the multigraph.Comment: 33 pages, 8 figure
Изучение структуры цинктитановых боросиликатных стекол по данным рассеяния рентгеновских лучей под малыми углами
В статті вивчено мікронеоднорідну будову цинктитанових боросилікатних стекол та процесів фазового розділу в них за даним розсіяння нейтронів під малими кутами. Зроблено висновок про характер розподілення часток, що виділяються за розмірами, які змінюються в дослідних стеклах в залежності від вмісту в них TiO₂ та ZnO. Встановлено вплив наявності мікронеоднорідностей після варки на характер їх фазовогорозподілення.In paper the micronon-uniform structure zinc-titanium borosilicate glass and processes of phase separation in them according to diffusing under vanishing angles of neutrons is investigated. It is drawn a In paper the micronon-uniform structure zinc-titanium borosilicate glass and processes of phase separation in them according to diffusing under vanishing angles of neutrons is investigated. It is drawn a leading-out on distribution of depositing corpuscles character on sizes which changes in studied glasses depending on the contents in them TiO₂ and ZnO. Effect of presence micro micronon-uniforms after melting on character of their phase separationis established
Exact Solution Methods for the -item Quadratic Knapsack Problem
The purpose of this paper is to solve the 0-1 -item quadratic knapsack
problem , a problem of maximizing a quadratic function subject to two
linear constraints. We propose an exact method based on semidefinite
optimization. The semidefinite relaxation used in our approach includes simple
rank one constraints, which can be handled efficiently by interior point
methods. Furthermore, we strengthen the relaxation by polyhedral constraints
and obtain approximate solutions to this semidefinite problem by applying a
bundle method. We review other exact solution methods and compare all these
approaches by experimenting with instances of various sizes and densities.Comment: 12 page
Approximation algorithms for general cluster routing problem
Graph routing problems have been investigated extensively in operations
research, computer science and engineering due to their ubiquity and vast
applications. In this paper, we study constant approximation algorithms for
some variations of the general cluster routing problem. In this problem, we are
given an edge-weighted complete undirected graph whose vertex set
is partitioned into clusters We are also given a subset
of and a subset of The weight function satisfies the
triangle inequality. The goal is to find a minimum cost walk that visits
each vertex in only once, traverses every edge in at least once and
for every all vertices of are traversed consecutively.Comment: In COCOON 202
A Unifying Model of Genome Evolution Under Parsimony
We present a data structure called a history graph that offers a practical
basis for the analysis of genome evolution. It conceptually simplifies the
study of parsimonious evolutionary histories by representing both substitutions
and double cut and join (DCJ) rearrangements in the presence of duplications.
The problem of constructing parsimonious history graphs thus subsumes related
maximum parsimony problems in the fields of phylogenetic reconstruction and
genome rearrangement. We show that tractable functions can be used to define
upper and lower bounds on the minimum number of substitutions and DCJ
rearrangements needed to explain any history graph. These bounds become tight
for a special type of unambiguous history graph called an ancestral variation
graph (AVG), which constrains in its combinatorial structure the number of
operations required. We finally demonstrate that for a given history graph ,
a finite set of AVGs describe all parsimonious interpretations of , and this
set can be explored with a few sampling moves.Comment: 52 pages, 24 figure
Portfolio selection problems in practice: a comparison between linear and quadratic optimization models
Several portfolio selection models take into account practical limitations on
the number of assets to include and on their weights in the portfolio. We
present here a study of the Limited Asset Markowitz (LAM), of the Limited Asset
Mean Absolute Deviation (LAMAD) and of the Limited Asset Conditional
Value-at-Risk (LACVaR) models, where the assets are limited with the
introduction of quantity and cardinality constraints. We propose a completely
new approach for solving the LAM model, based on reformulation as a Standard
Quadratic Program and on some recent theoretical results. With this approach we
obtain optimal solutions both for some well-known financial data sets used by
several other authors, and for some unsolved large size portfolio problems. We
also test our method on five new data sets involving real-world capital market
indices from major stock markets. Our computational experience shows that,
rather unexpectedly, it is easier to solve the quadratic LAM model with our
algorithm, than to solve the linear LACVaR and LAMAD models with CPLEX, one of
the best commercial codes for mixed integer linear programming (MILP) problems.
Finally, on the new data sets we have also compared, using out-of-sample
analysis, the performance of the portfolios obtained by the Limited Asset
models with the performance provided by the unconstrained models and with that
of the official capital market indices
Business Models and E-Services: an Ontological Approach in a Cross-border Environment
Monograph's chapter
Combined Analysis of Neutrino and Antineutrino Oscillations at T2K
T2K reports its first results in the search for CP violation in neutrino oscillations using appearance and disappearance channels for neutrino- and antineutrino-mode beams. The data include all runs from January 2010 to May 2016 and comprise 7.482×1020 protons on target in neutrino mode, which yielded in the far detector 32 e-like and 135 μ-like events, and 7.471×1020 protons on target in antineutrino mode, which yielded 4 e-like and 66 μ-like events. Reactor measurements of sin22θ13 have been used as an additional constraint. The one-dimensional confidence interval at 90% for the phase δCP spans the range (-3.13, -0.39) for normal mass ordering. The CP conservation hypothesis (δCP=0, π) is excluded at 90% C.L
- …