✦ LIBER ✦

Constant-factor approximation of the domination number in sparse graphs

✍ Scribed by Dvořák, Zdeněk

Book ID: 118747173
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 384 KB
Volume: 34
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2012.12.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A better constant-factor approximation f

A better constant-factor approximation for weighted dominating set in unit disk graph

✍ Yaochun Huang; Xiaofeng Gao; Zhao Zhang; Weili Wu 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 417 KB

This paper presents a (10 + ε)-approximation algorithm to compute minimum-weight connected dominating set (MWCDS) in unit disk graph. MWCDS is to select a vertex subset with minimum weight for a given unit disk graph, such that each vertex of the graph is contained in this subset or has a neigh

On the total domination subdivision numb

On the total domination subdivision number in some classes of graphs

✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 302 KB

Determining the Number of Factors in App

Determining the Number of Factors in Approximate Factor Models

✍ Jushan Bai; Serena Ng 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

On the size and structure of graphs with

On the size and structure of graphs with a constant number of 1-factors

✍ Andrzej Dudek; John R. Schmitt 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 198 KB

Constant-factor approximations of branch

Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in time

✍ Qian-Ping Gu; Hisao Tamaki 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 297 KB

The number of cycles in 2-factors of cub

The number of cycles in 2-factors of cubic graphs

✍ Moshe Rosenfeld 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 758 KB