5 papers
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
In this research, we examine the minsum flow problem in dynamic path networks where flows are represented as discrete and weighted sets. The minsum flow problem has been widely stu…
On Approximating the Dynamic and Discrete Network Flow Problem
Bubai Manna, Bodhayan Roy, Vorapong Suppakitpaisarn
We examine the dynamic network flow problem under the assumption that the flow consists of discrete units. The dynamic network flow problem is commonly addressed in the context of…
Utilizing Graph Sparsification for Pre-processing in Maxcut QUBO Solver
Vorapong Suppakitpaisarn, Jin-Kao Hao
We suggest employing graph sparsification as a pre-processing step for maxcut programs using the QUBO solver. Quantum(-inspired) algorithms are recognized for their potential effic…
Local Differential Privacy for Number of Paths and Katz Centrality
Louis Betzer, Vorapong Suppakitpaisarn, Quentin Hillebrand
In this paper, we give an algorithm to publish the number of paths and Katz centrality under the local differential privacy (LDP), providing a thorough theoretical analysis. Althou…
Efficient Additions and Montgomery Reductions of Large Integers for SIMD
Pengchang Ren, Reiji Suda, Vorapong Suppakitpaisarn
This paper presents efficient algorithms, designed to leverage SIMD for performing Montgomery reductions and additions on integers larger than 512 bits. The existing algorithms enc…