sparsest cut Latest Research Papers

A quasipolynomial (2 + ε )-approximation for planar sparsest cut

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3406325.3451103 ◽

2021 ◽

Author(s):

Vincent Cohen-Addad ◽

Anupam Gupta ◽

Philip N. Klein ◽

Jason Li

Keyword(s):

Sparsest Cut

Download Full-text

Multi-way sparsest cut problem on trees with a control on the number of parts and outliers

Discrete Applied Mathematics ◽

10.1016/j.dam.2020.11.013 ◽

2021 ◽

Vol 289 ◽

pp. 281-291

Author(s):

Ramin Javadi ◽

Saleh Ashkboos

Keyword(s):

Sparsest Cut Problem ◽

Sparsest Cut

Download Full-text

SCE: Scalable Network Embedding from Sparsest Cut

Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining ◽

10.1145/3394486.3403068 ◽

2020 ◽

Author(s):

Shengzhong Zhang ◽

Zengfeng Huang ◽

Haicang Zhou ◽

Ziang Zhou

Keyword(s):

Network Embedding ◽

Scalable Network ◽

Sparsest Cut

Download Full-text

New hardness results for planar graph problems in p and an algorithm for sparsest cut

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ◽

10.1145/3357713.3384310 ◽

2020 ◽

Author(s):

Amir Abboud ◽

Vincent Cohen-Addad ◽

Philip N. Klein

Keyword(s):

Planar Graph ◽

Graph Problems ◽

Sparsest Cut

Download Full-text

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem

Mathematical Programming ◽

10.1007/s10107-017-1227-3 ◽

2018 ◽

Vol 172 (1-2) ◽

pp. 59-75

Author(s):

Mourad Baïou ◽

Francisco Barahona

Keyword(s):

Planar Graphs ◽

Max Cut Problem ◽

Sparsest Cut

Download Full-text

SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-319-94776-1_57 ◽

2018 ◽

pp. 688-700 ◽

Cited By ~ 1

Author(s):

T.-H. Hubert Chan ◽

Bintao Sun

Keyword(s):

Approximation Algorithms ◽

Primal Dual ◽

Sparsest Cut ◽

Directed Hypergraph

Download Full-text

Sparsest Cut Approximation Using Single Commodity Flows

SSRN Electronic Journal ◽

10.2139/ssrn.3305748 ◽

2018 ◽

Author(s):

Korbinian Abstreiter

Keyword(s):

Commodity Flows ◽

Sparsest Cut ◽

Single Commodity

Download Full-text

The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 ◽

10.1145/3055399.3055413 ◽

2017 ◽

Cited By ~ 2

Author(s):

Assaf Naor ◽

Robert Young

Keyword(s):

Constant Multiple ◽

Sdp Relaxation ◽

Integrality Gap ◽

Sparsest Cut

Download Full-text

Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611974782.53 ◽

2017 ◽

Cited By ~ 4

Author(s):

Moses Charikar ◽

Vaggos Chatziafratis

Keyword(s):

Hierarchical Clustering ◽

Sparsest Cut

Download Full-text

Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2016.03.004 ◽

2016 ◽

Vol 82 (6) ◽

pp. 1044-1063

Author(s):

Mohammad Khairul Hasan ◽

Kyung-Yong Chwa

Keyword(s):

Approximation Algorithms ◽

Graph Partitioning ◽

Partitioning Problems ◽

Sparsest Cut

Download Full-text

sparsest cut
Recently Published Documents

TOTAL DOCUMENTS

H-INDEX

A quasipolynomial (2 + ε )-approximation for planar sparsest cut

Multi-way sparsest cut problem on trees with a control on the number of parts and outliers

SCE: Scalable Network Embedding from Sparsest Cut

New hardness results for planar graph problems in p and an algorithm for sparsest cut

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem

SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands

Sparsest Cut Approximation Using Single Commodity Flows

The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n

Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics

Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems

Export Citation Format

sparsest cutRecently Published Documents

TOTAL DOCUMENTS

H-INDEX

A quasipolynomial (2 + ε )-approximation for planar sparsest cut

Multi-way sparsest cut problem on trees with a control on the number of parts and outliers

SCE: Scalable Network Embedding from Sparsest Cut

New hardness results for planar graph problems in p and an algorithm for sparsest cut

Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem

SDP Primal-Dual Approximation Algorithms for Directed Hypergraph Expansion and Sparsest Cut with Product Demands

Sparsest Cut Approximation Using Single Commodity Flows

The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n

Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics

Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems

sparsest cut
Recently Published Documents