An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets

INFORMS Journal on Computing- United States

doi 10.1287/ijoc.2014.0619

Full Text

Abstract

Available in

Date

Authors

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Linear Separation of Connected Dominating Sets in Graphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Movability of Dominating, Independent Dominating and Doubly Connected Dominating Sets in the Composition of Graphs

Applied Mathematical Sciences
2015English

Fault-Tolerant Metric Dimension Problem: A New Integer Linear Programming Formulation and Exact Formula for Grid Graphs

Kragujevac Journal of Mathematics
Mathematics
2018English

An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems

American Journal of Operations Research
2011English

Constructing Minimum Connected Dominating Set: Algorithmic Approach

International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks
2010English

An All-Integer Integer Programming Algorithm

1963Norwegian Bokmål

Influence Maximization in Social Networks: An Integer Programming Approach

Turkish Journal of Electrical Engineering and Computer Sciences
Electronic EngineeringElectricalComputer Science
2018English

A Distributed Greedy Algorithm for Constructing Connected Dominating Sets in Wireless Sensor Networks

2014English

Fault-Tolerant Routing in Mesh-Connected 2D Tori

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy