Code and Data Repository for A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set

The goal of this repository is to demonstrate the efficiency of our algorithm for Minimum-Weight ( 1 , m ) --Connected Dominating Set.

Authors

Ding‐Zhu Du (ORCID: https://orcid.org/0000-0002-7345-2185)
Pãnos M. Pardalos (ORCID: https://orcid.org/0000-0001-9623-8053)
Shaojie Tang (ORCID: https://orcid.org/0000-0001-9261-5210)
Zhao Zhang (ORCID: https://orcid.org/0000-0003-4191-7598)
Yingli Ran
Jiao Zhou (ORCID: https://orcid.org/0000-0002-0506-1932)

Publication Details

Journal: INFORMS journal on computing
Published: 2024-11-01
DOI: https://doi.org/10.1287/ijoc.2023.0306.cd
Primary Topic: Scheduling and Optimization Algorithms
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Code and Data Repository for A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set

Ding‐Zhu Du, Pãnos M. Pardalos, Shaojie Tang, Zhao Zhang et al.

Nov 1, 2024

INFORMS journal on computing

Scheduling and Optimization Algorithms

article

Code and Data Repository for A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set

Ding‐Zhu Du, Pãnos M. Pardalos, Shaojie Tang, Zhao Zhang, Yingli Ran, Jiao Zhou

November 1, 2024article en

Abstract

The goal of this repository is to demonstrate the efficiency of our algorithm for Minimum-Weight ( 1 , m ) --Connected Dominating Set.

INFORMS journal on computing

Openalex Percentile: Top 71%

Scheduling and Optimization Algorithms

DOI Source OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Code and Data Repository for A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set — Ding‐Zhu Du, Pãnos M. Pardalos, et al. · INFORMS journal on computing (2024) | TGRS Research Map | TGRS