633 research outputs found
Topological Additive Numbering of Directed Acyclic Graphs
We propose to study a problem that arises naturally from both Topological
Numbering of Directed Acyclic Graphs, and Additive Coloring (also known as
Lucky Labeling). Let be a digraph and a labeling of its vertices with
positive integers; denote by the sum of labels over all neighbors of
each vertex . The labeling is called \emph{topological additive
numbering} if for each arc of the digraph. The problem
asks to find the minimum number for which has a topological additive
numbering with labels belonging to , denoted by
.
We characterize when a digraph has topological additive numberings, give a
lower bound for , and provide an integer programming formulation for
our problem, characterizing when its coefficient matrix is totally unimodular.
We also present some families for which can be computed in
polynomial time. Finally, we prove that this problem is \np-Hard even when its
input is restricted to planar bipartite digraphs
The inapproximability for the (0,1)-additive number
An
{\it additive labeling} of a graph is a function , such that for every two adjacent vertices and of , ( means that is joined to ). The {\it additive number} of ,
denoted by , is the minimum number such that has a additive
labeling . The {\it additive
choosability} of a graph , denoted by , is the smallest
number such that has an additive labeling for any assignment of lists
of size to the vertices of , such that the label of each vertex belongs
to its own list.
Seamone (2012) \cite{a80} conjectured that for every graph , . We give a negative answer to this conjecture and we show that
for every there is a graph such that .
A {\it -additive labeling} of a graph is a function , such that for every two adjacent vertices and
of , .
A graph may lack any -additive labeling. We show that it is -complete to decide whether a -additive labeling exists for
some families of graphs such as perfect graphs and planar triangle-free graphs.
For a graph with some -additive labelings, the -additive
number of is defined as where is the set of -additive labelings of .
We prove that given a planar graph that admits a -additive labeling, for
all , approximating the -additive number within is -hard.Comment: 14 pages, 3 figures, Discrete Mathematics & Theoretical Computer
Scienc
Sigma Partitioning: Complexity and Random Graphs
A of a graph is a partition of the vertices
into sets such that for every two adjacent vertices and
there is an index such that and have different numbers of
neighbors in . The of a graph , denoted by
, is the minimum number such that has a sigma partitioning
. Also, a of a graph is a
function , such that for every two adjacent
vertices and of , ( means that and are adjacent). The of , denoted by , is the minimum number such
that has a lucky labeling . It was
conjectured in [Inform. Process. Lett., 112(4):109--112, 2012] that it is -complete to decide whether for a given 3-regular
graph . In this work, we prove this conjecture. Among other results, we give
an upper bound of five for the sigma number of a uniformly random graph
Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm
Many practical problems in almost all scientific and technological
disciplines have been classified as computationally hard (NP-hard or even
NP-complete). In life sciences, combinatorial optimization problems frequently
arise in molecular biology, e.g., genome sequencing; global alignment of
multiple genomes; identifying siblings or discovery of dysregulated pathways.In
almost all of these problems, there is the need for proving a hypothesis about
certain property of an object that can be present only when it adopts some
particular admissible structure (an NP-certificate) or be absent (no admissible
structure), however, none of the standard approaches can discard the hypothesis
when no solution can be found, since none can provide a proof that there is no
admissible structure. This article presents an algorithm that introduces a
novel type of solution method to "efficiently" solve the graph 3-coloring
problem; an NP-complete problem. The proposed method provides certificates
(proofs) in both cases: present or absent, so it is possible to accept or
reject the hypothesis on the basis of a rigorous proof. It provides exact
solutions and is polynomial-time (i.e., efficient) however parametric. The only
requirement is sufficient computational power, which is controlled by the
parameter . Nevertheless, here it is proved that the
probability of requiring a value of to obtain a solution for a
random graph decreases exponentially: , making
tractable almost all problem instances. Thorough experimental analyses were
performed. The algorithm was tested on random graphs, planar graphs and
4-regular planar graphs. The obtained experimental results are in accordance
with the theoretical expected results.Comment: Working pape
Improved Local Search for Geometric Hitting Set
International audienceOver the past several decades there has been steady progress towards the goal of polynomial-time approximation schemes (PTAS) for fundamental geometric combinatorial optimization problems. A foremost example is the geometric hitting set problem: given a set P of points and a set D of geometric objects, compute the minimum-sized subset of P that hits all objects in D. For the case where D is a set of disks in the plane, the 30-year quest for a PTAS, starting from the seminal work of Hochbaum [19], was finally achieved in 2010. Surprisingly, the algorithm to achieve the PTAS is simple: local-search. Since then, local-search has turned out to be a powerful algorithmic approach towards achieving good approximation ratios for geometric problems (for geometric independent-set problem, for dominating sets, for the terrain guarding problem and several others). Unfortunately all these algorithms have the same limitation: local search is able to give a PTAS, but with hopeless running times; e.g., a 3-approximation for the geometric hitting takes more than n 66 time [15] for the geometric hitting set problem for disks in the plane! That leaves open the question of whether a better understanding – both combinatorial and algorithmic – of local search and the problem can give a better approximation ratio in a more reasonable time. In this paper, we investigate this question for one of the fundamental problems, hitting sets for disks in the plane. We present tight approximation bounds for (3, 2)-local search 1 and give an (8 + algorithm with running time O(n 2.34); the previous-best result achieving a similar approximation ratio gave a 10-approximation in time O(n 15) – that too just for unit disks. The techniques and ideas generalize to (4, 3) local search. Furthermore, as mentioned earlier, local-search has been used for several other geometric optimization problems; for all these problems our results show that (3, 2) local search gives an 8-approximation and no better 2. Similarly (4, 3)-local search gives a 5-approximation for all these problems
- …