Optimal Partition of a Tree with Social Distance

Masahiro Okubo; Tesshu Hanaka; Hirotaka Ono

doi:10.1007/978-3-030-10564-8_10

Optimal Partition of a Tree with Social Distance

Masahiro Okubo, Tesshu Hanaka, Hirotaka Ono

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

We study the problem to find a partition of a graph G with maximum social welfare based on social distance between vertices in G, called MaxSWP. This problem is known to be NP-hard in general. In this paper, we first give a complete characterization of optimal partitions of trees with small diameters. Then, by utilizing these results, we show that MaxSWP can be solved in linear time for trees. Moreover, we show that MaxSWP is NP-hard even for 4-regular graphs.

Original language	English
Title of host publication	WALCOM
Subtitle of host publication	Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings
Editors	Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano
Publisher	Springer Verlag
Pages	121-132
Number of pages	12
ISBN (Print)	9783030105631
DOIs	https://doi.org/10.1007/978-3-030-10564-8_10
Publication status	Published - 2019
Externally published	Yes
Event	13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019 - Guwahati, India Duration: Feb 27 2019 → Mar 2 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11355 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019
Country/Territory	India
City	Guwahati
Period	2/27/19 → 3/2/19

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-030-10564-8_10

Cite this

Okubo, M., Hanaka, T., & Ono, H. (2019). Optimal Partition of a Tree with Social Distance. In G. K. Das, P. S. Mandal, K. Mukhopadhyaya, & S. Nakano (Eds.), WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings (pp. 121-132). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11355 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-10564-8_10

Optimal Partition of a Tree with Social Distance. / Okubo, Masahiro; Hanaka, Tesshu; Ono, Hirotaka.

WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings. ed. / Gautam K. Das; Partha S. Mandal; Krishnendu Mukhopadhyaya; Shin-ichi Nakano. Springer Verlag, 2019. p. 121-132 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11355 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Okubo, M, Hanaka, T & Ono, H 2019, Optimal Partition of a Tree with Social Distance. in GK Das, PS Mandal, K Mukhopadhyaya & S Nakano (eds), WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11355 LNCS, Springer Verlag, pp. 121-132, 13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019, Guwahati, India, 2/27/19. https://doi.org/10.1007/978-3-030-10564-8_10

Okubo M, Hanaka T, Ono H. Optimal Partition of a Tree with Social Distance. In Das GK, Mandal PS, Mukhopadhyaya K, Nakano S, editors, WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings. Springer Verlag. 2019. p. 121-132. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-10564-8_10

Okubo, Masahiro ; Hanaka, Tesshu ; Ono, Hirotaka. / Optimal Partition of a Tree with Social Distance. WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Proceedings. editor / Gautam K. Das ; Partha S. Mandal ; Krishnendu Mukhopadhyaya ; Shin-ichi Nakano. Springer Verlag, 2019. pp. 121-132 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{caef3b6870cd473bbfc55d53a6dc5348,

title = "Optimal Partition of a Tree with Social Distance",

abstract = "We study the problem to find a partition of a graph G with maximum social welfare based on social distance between vertices in G, called MaxSWP. This problem is known to be NP-hard in general. In this paper, we first give a complete characterization of optimal partitions of trees with small diameters. Then, by utilizing these results, we show that MaxSWP can be solved in linear time for trees. Moreover, we show that MaxSWP is NP-hard even for 4-regular graphs.",

author = "Masahiro Okubo and Tesshu Hanaka and Hirotaka Ono",

note = "Funding Information: by JSPS KAKENHI Grant Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019 ; Conference date: 27-02-2019 Through 02-03-2019",

year = "2019",

doi = "10.1007/978-3-030-10564-8_10",

language = "English",

isbn = "9783030105631",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "121--132",

editor = "Das, {Gautam K.} and Mandal, {Partha S.} and Krishnendu Mukhopadhyaya and Shin-ichi Nakano",

booktitle = "WALCOM",

address = "Germany",

}

TY - GEN

T1 - Optimal Partition of a Tree with Social Distance

AU - Okubo, Masahiro

AU - Hanaka, Tesshu

AU - Ono, Hirotaka

PY - 2019

Y1 - 2019

N2 - We study the problem to find a partition of a graph G with maximum social welfare based on social distance between vertices in G, called MaxSWP. This problem is known to be NP-hard in general. In this paper, we first give a complete characterization of optimal partitions of trees with small diameters. Then, by utilizing these results, we show that MaxSWP can be solved in linear time for trees. Moreover, we show that MaxSWP is NP-hard even for 4-regular graphs.

AB - We study the problem to find a partition of a graph G with maximum social welfare based on social distance between vertices in G, called MaxSWP. This problem is known to be NP-hard in general. In this paper, we first give a complete characterization of optimal partitions of trees with small diameters. Then, by utilizing these results, we show that MaxSWP can be solved in linear time for trees. Moreover, we show that MaxSWP is NP-hard even for 4-regular graphs.

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

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

U2 - 10.1007/978-3-030-10564-8_10

DO - 10.1007/978-3-030-10564-8_10

M3 - Conference contribution

AN - SCOPUS:85062662226

SN - 9783030105631

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 121

EP - 132

BT - WALCOM

A2 - Das, Gautam K.

A2 - Mandal, Partha S.

A2 - Mukhopadhyaya, Krishnendu

A2 - Nakano, Shin-ichi

PB - Springer Verlag

T2 - 13th International Conference and Workshop on Algorithms and Computations, WALCOM 2019

Y2 - 27 February 2019 through 2 March 2019

ER -

Optimal Partition of a Tree with Social Distance

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this