Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343): Difference between revisions

Latest revision as of 15:31, 30 December 2024

scientific article; zbMATH DE number 7350700

Language	Label	Description	Also known as
English	Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set	scientific article; zbMATH DE number 7350700

Statements

instance of

scholarly article

0 references

title

Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (English)

0 references

0 references

0 references

0 references

0 references

Journal of Artificial Intelligence Research

0 references

publication date

25 May 2021

0 references

zbMATH Keywords

heuristics

0 references

search

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1613/jair.1.12618

0 references

cites work

Efficient virtual-backbone routing in mobile ad hoc networks

0 references

An exact exponential-time algorithm for the directed maximum leaf spanning tree problem

0 references

Local search for Boolean satisfiability with configuration checking and subscore

0 references

Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

0 references

The regenerator location problem

0 references

A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks

0 references

Logic programming and nonmonotonic reasoning. 10th international conference, LPNMR 2009, Potsdam, Germany, September 14--18, 2009. Proceedings

0 references

Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming

0 references

An exact algorithm for the maximum leaf spanning tree problem

0 references

Solving connected dominating set faster than \(2^n\)

0 references

Q3096211

0 references

Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem

0 references

Revisiting connected dominating sets: an almost optimal local information algorithm

0 references

Reformulations and solution algorithms for the maximum leaf spanning tree problem

0 references

A greedy approximation for minimum connected dominating sets

0 references

The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm

0 references

A 2-approximation algorithm for finding a spanning tree with maximum number of leaves

0 references

Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function

0 references

BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING

0 references

Restricted swap-based neighborhood search for the minimum connected dominating set problem

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4989343

@@ Property / DOI @@
-.1613/jair.1.12618
@@ Property / DOI: 10.1613/jair.1.12618 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q131025035
@@ Property / Wikidata QID: Q131025035 / rank @@
+Normal rank
@@ Property / DOI @@
+.1613/JAIR.1.12618
@@ Property / DOI: 10.1613/JAIR.1.12618 / rank @@
+Normal rank