Analysis on Theoretical Bounds for Approximating Dominating Set Problems

Discrete Mathematics, Algorithms and Applications - Singapore
doi 10.1142/s1793830909000105
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

Fixed Parameter Algorithms for Planar Dominating Set and Related Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Multi-Start Local Search Algorithm for the Minimum Connected Dominating Set Problems

Mathematics
Mathematics
2019English

Exact Algorithms for Dominating Clique Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Connected Dominating Set Construction Algorithm for Wireless Networks Based on Connected Subset

Journal of Communications
2016English

Constructing Minimum Connected Dominating Set: Algorithmic Approach

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

Linear Kernels for (Connected) Dominating Set onH-minor-free Graphs

2012English

Lower Bounds on Streaming Algorithms for Approximating the Length of the Longest Increasing Subsequence

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Computer NetworksOpticsMolecular Physics,CommunicationsOpticalAtomicMagnetic MaterialsElectronic
2007English

Uniform Bounds for Isoperimetric Problems

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1989English

On the Approximability of Positive Influence Dominating Set in Social Networks

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy