Hypergraph cuts with general splitting functions
The minimum st cut problem in graphs is one of the most fundamental problems in
combinatorial optimization, and graph cuts underlie algorithms throughout discrete …
combinatorial optimization, and graph cuts underlie algorithms throughout discrete …
Cut sparsification and succinct representation of submodular hypergraphs
Y Kenneth, R Krauthgamer - ar** spectral, and metric embedding based
approximation algorithms for hypergraph generalizations of conductance, little is known …
approximation algorithms for hypergraph generalizations of conductance, little is known …
[PDF][PDF] Thesis for the degree
Y Kenneth - 2023 - wisdom.weizmann.ac.il
Modern data analysis requires sifting through ever-increasing amounts of observations, this
increases the computational and storage cost of analyzing the data. One solution to this …
increases the computational and storage cost of analyzing the data. One solution to this …
Fixed Parameter Tractable Algorithm and Coreset for the Ordered k-Median problem
M Osadnik - 2023 - aaltodoc.aalto.fi
Clustering problems are among the most central problems that arise in many research
areas, such as machine learning, data mining, and algorithms. The goal of such problems is …
areas, such as machine learning, data mining, and algorithms. The goal of such problems is …