Heuristic algorithms for the min-max edge 2-coloring problem

In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named \emph{maximum edge $q$-coloring} and studied in several papers by Feng et. al (TAMC 2007), Adamaszek and Popa (ISAAC 2010, JDA 2016). Later on Larjomaa and Popa (IWOCA 2014, JGAA 2015) define and study an alternative variant, named the \emph{min-max edge $q$-coloring}. The above mentioned graph problems, namely the maximum edge $q$-coloring and the min-max edge $q$-coloring are studied mainly from the theoretical perspective. In this paper, we study the min-max edge 2-coloring problem from a practical perspective. More precisely, we introduce, implement and test four heuristic approximation algorithms for the min-max edge $2$-coloring problem. These algorithms are based on a \emph{Breadth First Search} (BFS)-based heuristic and on \emph{local search} methods like basic \emph{hill climbing}, \emph{simulated annealing} and \emph{tabu search} techniques, respectively. Although several algorithms for particular graph classes were proposed by Larjomaa and Popa (e.g., trees, planar graphs, cliques, bi-cliques, hypergraphs), we design the first algorithms for general graphs. We study and compare the running data for all algorithms on Unit Disk Graphs, as well as some graphs from the DIMACS vertex coloring benchmark dataset.Comment: This is a post-peer-review, pre-copyedit version of an article published in International Computing and Combinatorics Conference (COCOON'18). The final authenticated version is available online at: http://www.doi.org/10.1007/978-3-319-94776-1_5

Superalgebra and Conservative Quantities in N=1 Self-dual Supergravity

The N=1 self-dual supergravity has SL(2,C) and the left-handed and right -handed local supersymmetries. These symmetries result in SU(2) charges as the angular-momentum and the supercharges. The model possesses also the invariance under the general translation transforms and this invariance leads to the energy-momentum. All the definitions are generally covariant . As the SU(2) charges and the energy-momentum we obtained previously constituting the 3-Poincare algebra in the Ashtekar's complex gravity, the SU(2) charges, the supercharges and the energy-momentum here also restore the super-Poincare algebra, and this serves to support the reasonableness of their interpretations.Comment: 18 pages, Latex, no figure

Study of gossamer superconductivity and antiferromagnetism in the t-J-U model

The d-wave superconductivity (dSC) and antiferromagnetism are analytically studied in a renormalized mean field theory for a two dimensional t-J model plus an on-site repulsive Hubbard interaction $U$. The purpose of introducing the $U$ term is to partially impose the no double occupancy constraint by employing the Gutzwiller approximation. The phase diagrams as functions of doping $\delta$ and $U$ are studied. Using the standard value of $t/J=3.0$ and in the large $U$ limit, we show that the antiferromagnetic (AF) order emerges and coexists with the dSC in the underdoped region below the doping $\delta\sim0.1$. The dSC order parameter increases from zero as the doping increases and reaches a maximum near the optimal doping $\delta\sim0.15$. In the small $U$ limit, only the dSC order survives while the AF order disappears. As $U$ increased to a critical value, the AF order shows up and coexists with the dSC in the underdoped regime. At half filing, the system is in the dSC state for small $U$ and becomes an AF insulator for large $U$. Within the present mean field approach, We show that the ground state energy of the coexistent state is always lower than that of the pure dSC state.Comment: 7 pages, 8 figure