8,276 research outputs found
Algorithms for the minimum sum coloring problem: a review
The Minimum Sum Coloring Problem (MSCP) is a variant of the well-known vertex
coloring problem which has a number of AI related applications. Due to its
theoretical and practical relevance, MSCP attracts increasing attention. The
only existing review on the problem dates back to 2004 and mainly covers the
history of MSCP and theoretical developments on specific graphs. In recent
years, the field has witnessed significant progresses on approximation
algorithms and practical solution algorithms. The purpose of this review is to
provide a comprehensive inspection of the most recent and representative MSCP
algorithms. To be informative, we identify the general framework followed by
practical solution algorithms and the key ingredients that make them
successful. By classifying the main search strategies and putting forward the
critical elements of the reviewed methods, we wish to encourage future
development of more powerful methods and motivate new applications
Colored Non-Crossing Euclidean Steiner Forest
Given a set of -colored points in the plane, we consider the problem of
finding trees such that each tree connects all points of one color class,
no two trees cross, and the total edge length of the trees is minimized. For
, this is the well-known Euclidean Steiner tree problem. For general ,
a -approximation algorithm is known, where is the
Steiner ratio.
We present a PTAS for , a -approximation algorithm
for , and two approximation algorithms for general~, with ratios
and
Matching parton showers to NLO computations
We give a prescription for attaching parton showers to next-to-leading order
(NLO) partonic jet cross sections in electron-positron annihilation. Our method
effectively extends to NLO the scheme of Catani, Krauss, Kuhn, and Webber for
matching between m hard jets and (m+1) hard jets. The matching between parton
splitting as part of a shower and parton splitting as part of NLO matrix
elements is based on the Catani-Seymour dipole subtraction method that is
commonly used for removing the singularities from the NLO matrix elements.}Comment: 45 pages, new introduction, more detailed discussion of the Sudakov
reweightin
Efficient Decoding of Topological Color Codes
Color codes are a class of topological quantum codes with a high error
threshold and large set of transversal encoded gates, and are thus suitable for
fault tolerant quantum computation in two-dimensional architectures. Recently,
computationally efficient decoders for the color codes were proposed. We
describe an alternate efficient iterative decoder for topological color codes,
and apply it to the color code on hexagonal lattice embedded on a torus. In
numerical simulations, we find an error threshold of 7.8% for independent
dephasing and spin flip errors.Comment: 7 pages, LaTe
- …