Wireless networking, dominating and packing (Q1958633)

From MaRDI portal

Revision as of 15:49, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Wireless networking, dominating and packing	scientific article

Statements

scholarly article

0 references

Wireless networking, dominating and packing (English)

0 references

0 references

0 references

Panos M. Pardalos

0 references

0 references

Optimization Letters

0 references

publication date

4 October 2010

0 references

zbMATH Keywords

wireless network

0 references

dominating set

0 references

packing

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11590-009-0151-8

0 references

Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs

0 references

On connected domination in unit ball graphs

0 references

Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

0 references

Approximations for Steiner trees with minimum number of Steiner points

0 references

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

0 references

Unit disk graphs

0 references

Tight upper bounds for the domination numbers of graphs with given order and minimum degree

0 references

A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph

0 references

0 references

0 references

0 references

ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS

0 references

(6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs

0 references

0 references

Approximation algorithms for connected dominating sets

0 references

MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS

0 references

Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks

0 references

Steiner tree problem with minimum number of Steiner points and bounded edge-length

0 references

Improving construction for connected dominating set with Steiner tree in wireless sensor networks

0 references

Approximation schemes for wireless networks

0 references

0 references

A greedy approximation for minimum connected dominating sets

0 references

0 references

Mathematical programming techniques for sensor networks

0 references

EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS

0 references

Minimum connected dominating sets and maximal independent sets in unit disk graphs

0 references

Algorithms for connected set cover problem and fault-tolerant connected set cover problem

0 references

A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks

0 references

New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs

0 references

Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S11590-009-0151-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1958633

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1958633&oldid=38811323"