Scilit logo
  • Rankings
  • Search Publications
    Cited-by Search
  • Sources
  • Publishers
  • Scholars
    Top Cited Scholars
  • Organizations
  • Scilit
    About Us
    Advisory Board
    Data Sources
    Career
    Support / Contact
    User Guide
    Publisher User
    Search Function
    Rankings Function
    API Resource
    Scilit Knowledge
    Metrics
    Scilit Recognitions
    Publications Classification
    Media
    News
    Blog
Register
  1. Home
  2. Publications
  3. Approximation Algorithms for Connected Dominating Sets
  1. Home
  2. Publications
  3. Approximation Algorithms for Connected Dominating Sets

Approximation Algorithms for Connected Dominating Sets

Authors:
  • SGS. Guha
    S. Guha
  • SKS. Khuller
    S. Khuller
Publisher website
Google Scholar
  • 1 September 2007
    • journal article
    • Published by Springer Nature in Algorithmica
    • Vol. 49  (1) , 79
    • DOI:10.1007/s00453-007-9015-8
Abstract
No abstract available
Keywords
  • CONNECTED DOMINATING SETS
  • APPROXIMATION ALGORITHMS
  • CONNECTED DOMINATING SET
  • WIRELESS COMMUNICATION
  • HARMONIC FUNCTION
  • MAXIMUM DEGREE
  • DOMINATING SET
  • STEINER TREE
  • STEINER TREE PROBLEM
Cited by 3 articles
Scilit logo

Have questions? Email us at support@scilit.com

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.

MDPI initiatives

  • MDPI Journals
  • MDPI Books
  • Sciforum
  • Proceedings Series
  • Preprints.org
  • SciProfiles
  • Encyclopedia
  • JAMS

Legal

  • Privacy
  • Terms
  • About
  • Contact
  • Disclaimer

Follow us

  • facebook icon
  • x icon
  • linkedin icon

Join us

  • Career

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.