The probabilistic minimum dominating set problem
type: Item
instance of: scholarly article
title: The probabilistic minimum dominating set problem
zbMATH Open document ID: 1376.05107
author: Nicolas Boria
author: C. Murat
author: Vangelis Th. Paschos
published in: Discrete Applied Mathematics
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6820608
zbMATH Keywords: complexity
zbMATH Keywords: approximation
zbMATH Keywords: probabilistic optimization
zbMATH Keywords: dominating set
zbMATH Keywords: wireless sensor networks
MaRDI profile type: Publication
full work available at URL: j.dam.2016.10.016
OpenAlex ID: W2559859930
cites work: Probabilistic a priori routing-location problems
cites work: Estimation-based metaheuristics for the probabilistic traveling salesman problem
cites work: Some valid inequalities for the probabilistic minimum power multicasting problem
cites work: Wireless multicasting under probabilistic node failures: a heuristic approach
cites work: Q3277097
cites work: Traveling Salesman Facility Location Problems
cites work: The probabilistic minimum spanning tree problem
cites work: A Priori Optimization
cites work: Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
cites work: Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem
cites work: On the probabilistic min spanning tree problem
cites work: Probabilistic graph-coloring in bipartite and split graphs
cites work: Aggregation for the probabilistic traveling salesman problem
cites work: Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
cites work: A threshold of ln n for approximating set cover
cites work: Q4198056
cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
cites work: Shortest path problems with node failures
cites work: Q3799802
cites work: Approximation algorithms for combinatorial problems
cites work: Reducibility among Combinatorial Problems
cites work: On the ratio of optimal integral and fractional covers
cites work: Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers
cites work: Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks
cites work: The probabilistic longest path problem
cites work: A priori optimization for the probabilistic maximum independent set problem
cites work: The Probabilistic Minimum Vertex-covering Problem
cites work: On the probabilistic minimum coloring and minimum \(k\)-coloring
cites work: Q3291034
cites work: Steiner Forests on Stochastic Metric Graphs
cites work: Probabilistic models for the Steiner Tree problem
cites work: The complexity of computing the permanent
cites work: Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
DOI: 10.1016/J.DAM.2016.10.016
description: scientific article; zbMATH DE number 6820608