< Back to search results

Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter

Year of publication

2023

Authors

Chalermsook, Parinya; Kaul, Matthias; Mnich, Matthias; Spoerhase, Joachim; Uniyal, Sumedha; Vaz, Daniel

Organizations and authors

Aalto University

Chalermsook Parinya

Uniyal Sumedha

Publication type

Publication format

Article

Parent publication type

Journal

Article type

Original article

Audience

Scientific

Peer-reviewed

Peer-Reviewed

MINEDU's publication type classification code

A1 Journal article (refereed), original research

Publication channel information

Journal/Series

ACM Transactions on Algorithms

Publisher

Volume

20

Issue

1

Article number

6

Pages

1-20

ISSN

Publication forum

Publication forum level

3

Open access

Open access in the publisher’s service

No

Self-archived

Yes

Other information

Fields of science

Computer and information sciences

Internationality of the publisher

International

Language

English

International co-publication

Yes

Co-publication with a company

No

DOI

10.1145/3632623

The publication is included in the Ministry of Education and Culture’s Publication data collection

Yes