Inapproximability of maximum r-regular induced connected subgraph problems

Yuichi Asahiro, Hiroshi Eto, Eiji Miyano

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Given a connected graph G = (V, E) on n vertices, the Maximum r-Regular Induced Connected Subgraph (r-MaxRICS) problem asks for a maximum sized subset of vertices S ⊆ V such that the induced subgraph G[S] on S is connected and r-regular. It is known that 2-MaxRICS and 3-MaxRICS are NP-hard. Moreover, 2-MaxRICS cannot be approximated within a factor of n1-ε in polynomial time for any ε > 0 unless P = NP. In this paper, we show that r-MaxRICS are NP-hard for any fixed integer r ≥ 4. Furthermore, we show that for any fixed integer r ≥ 3, r-MaxRICS cannot be approximated within a factor of n1/6-ε in polynomial time for any ε > 0 unless P = NP.

Original languageEnglish
Pages (from-to)443-449
Number of pages7
JournalIEICE Transactions on Information and Systems
VolumeE96-D
Issue number3
DOIs
Publication statusPublished - Mar 2013
Externally publishedYes

Fingerprint

Polynomials

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

Inapproximability of maximum r-regular induced connected subgraph problems. / Asahiro, Yuichi; Eto, Hiroshi; Miyano, Eiji.

In: IEICE Transactions on Information and Systems, Vol. E96-D, No. 3, 03.2013, p. 443-449.

Research output: Contribution to journalArticle

@article{734ed019681d4f84a247efbc031b9d8d,
title = "Inapproximability of maximum r-regular induced connected subgraph problems",
abstract = "Given a connected graph G = (V, E) on n vertices, the Maximum r-Regular Induced Connected Subgraph (r-MaxRICS) problem asks for a maximum sized subset of vertices S ⊆ V such that the induced subgraph G[S] on S is connected and r-regular. It is known that 2-MaxRICS and 3-MaxRICS are NP-hard. Moreover, 2-MaxRICS cannot be approximated within a factor of n1-ε in polynomial time for any ε > 0 unless P = NP. In this paper, we show that r-MaxRICS are NP-hard for any fixed integer r ≥ 4. Furthermore, we show that for any fixed integer r ≥ 3, r-MaxRICS cannot be approximated within a factor of n1/6-ε in polynomial time for any ε > 0 unless P = NP.",
author = "Yuichi Asahiro and Hiroshi Eto and Eiji Miyano",
year = "2013",
month = "3",
doi = "10.1587/transinf.E96.D.443",
language = "English",
volume = "E96-D",
pages = "443--449",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "3",

}

TY - JOUR

T1 - Inapproximability of maximum r-regular induced connected subgraph problems

AU - Asahiro, Yuichi

AU - Eto, Hiroshi

AU - Miyano, Eiji

PY - 2013/3

Y1 - 2013/3

N2 - Given a connected graph G = (V, E) on n vertices, the Maximum r-Regular Induced Connected Subgraph (r-MaxRICS) problem asks for a maximum sized subset of vertices S ⊆ V such that the induced subgraph G[S] on S is connected and r-regular. It is known that 2-MaxRICS and 3-MaxRICS are NP-hard. Moreover, 2-MaxRICS cannot be approximated within a factor of n1-ε in polynomial time for any ε > 0 unless P = NP. In this paper, we show that r-MaxRICS are NP-hard for any fixed integer r ≥ 4. Furthermore, we show that for any fixed integer r ≥ 3, r-MaxRICS cannot be approximated within a factor of n1/6-ε in polynomial time for any ε > 0 unless P = NP.

AB - Given a connected graph G = (V, E) on n vertices, the Maximum r-Regular Induced Connected Subgraph (r-MaxRICS) problem asks for a maximum sized subset of vertices S ⊆ V such that the induced subgraph G[S] on S is connected and r-regular. It is known that 2-MaxRICS and 3-MaxRICS are NP-hard. Moreover, 2-MaxRICS cannot be approximated within a factor of n1-ε in polynomial time for any ε > 0 unless P = NP. In this paper, we show that r-MaxRICS are NP-hard for any fixed integer r ≥ 4. Furthermore, we show that for any fixed integer r ≥ 3, r-MaxRICS cannot be approximated within a factor of n1/6-ε in polynomial time for any ε > 0 unless P = NP.

UR - http://www.scopus.com/inward/record.url?scp=84878238046&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878238046&partnerID=8YFLogxK

U2 - 10.1587/transinf.E96.D.443

DO - 10.1587/transinf.E96.D.443

M3 - Article

AN - SCOPUS:84878238046

VL - E96-D

SP - 443

EP - 449

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 3

ER -