13 research outputs found
Robust maximum weighted independent-set problems on interval graphs.
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions. For a discrete scenario set, we find that the problem is NP-hard for each of the robustness criteria; we also provide pseudo-polynomial time algorithms when there is a constant number of scenarios and show that the problem is strongly NP-hard when the set of scenarios is unbounded. When the scenario set is a Cartesian product, we prove that the problem is equivalent to a maximum weighted independent-set problem on the same interval graph but without uncertainty for the first objective function and that the scenario set can be reduced for the second objective function.Combinatorial problems; Computational complexity; Interval graphs; Independent set;
Quantum Approximation for Wireless Scheduling
This paper proposes a quantum approximate optimization algorithm (QAOA)
method for wireless scheduling problems. The QAOA is one of the promising
hybrid quantum-classical algorithms for many applications and it provides
highly accurate optimization solutions in NP-hard problems. QAOA maps the given
problems into Hilbert spaces, and then it generates Hamiltonian for the given
objectives and constraints. Then, QAOA finds proper parameters from classical
optimization approaches in order to optimize the expectation value of generated
Hamiltonian. Based on the parameters, the optimal solution to the given problem
can be obtained from the optimum of the expectation value of Hamiltonian.
Inspired by QAOA, a quantum approximate optimization for scheduling (QAOS)
algorithm is proposed. First of all, this paper formulates a wireless
scheduling problem using maximum weight independent set (MWIS). Then, for the
given MWIS, the proposed QAOS designs the Hamiltonian of the problem. After
that, the iterative QAOS sequence solves the wireless scheduling problem. This
paper verifies the novelty of the proposed QAOS via simulations implemented by
Cirq and TensorFlow-Quantum
Listing Maximal Independent Sets with Minimal Space and Bounded Delay
International audienceAn independent set is a set of nodes in a graph such that no two of them are adjacent. It is maximal if there is no node outside the independent set that may join it. Listing maximal independent sets in graphs can be applied, for example, to sample nodes belonging to different communities or clusters in network analysis and document clustering. The problem has a rich history as it is related to maximal cliques, dominance sets, vertex covers and 3-colorings in graphs. We are interested in reducing the delay, which is the worst-case time between any two consecutively output solutions, and the memory footprint, which is the additional working space behind the read-only input graph
Recommended from our members
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
The greedy spanner in low dimensional Euclidean space is a fundamental geometric construction that has been extensively studied over three decades as it possesses the two most basic properties of a good spanner: constant maximum degree and constant lightness
Optimisation et balancement de la consommation d'énergie dans les réseaux ad hoc mobiles et de capteurs
Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal
Structure and topology of transcriptional regulatory networks and their applications in bio-inspired networking
Biological networks carry out vital functions necessary for sustenance despite environmental adversities. Transcriptional Regulatory Network (TRN) is one such biological network that is formed due to the interaction between proteins, called Transcription Factors (TFs), and segments of DNA, called genes. TRNs are known to exhibit functional robustness in the face of perturbation or mutation: a property that is proven to be a result of its underlying network topology. In this thesis, we first propose a three-tier topological characterization of TRN to analyze the interplay between the significant graph-theoretic properties of TRNs such as scale-free out-degree distribution, low graph density, small world property and the abundance of subgraphs called motifs. Specifically, we pinpoint the role of a certain three-node motif, called Feed Forward Loop (FFL) motif in topological robustness as well as information spread in TRNs.
With the understanding of the TRN topology, we explore its potential use in design of fault-tolerant communication topologies. To this end, we first propose an edge rewiring mechanism that remedies the vulnerability of TRNs to the failure of well-connected nodes, called hubs, while preserving its other significant graph-theoretic properties. We apply the rewired TRN topologies in the design of wireless sensor networks that are less vulnerable to targeted node failure. Similarly, we apply the TRN topology to address the issues of robustness and energy-efficiency in the following networking paradigms: robust yet energy-efficient delay tolerant network for post disaster scenarios, energy-efficient data-collection framework for smart city applications and a data transfer framework deployed over a fog computing platform for collaborative sensing --Abstract, page iii