Abstract: We propose a novel Greedy Graph Cut (GGC) algorithm to address the graph partitioning problem. The algorithm begins by treating each data point as an individual cluster and iteratively ...
Abstract: Reducing co-channel interference in wireless networks necessitates efficient channel assignment. If conflicting network nodes are divided into orthogonal channels, it is easy to lessen the ...
A production-grade RESTful API for optimizing delivery routes using greedy nearest-neighbor construction followed by 2-opt local-search improvement, with real-world driving distances.
A full-stack expense tracking and debt settlement application built with Go (Gin + GORM) backend and React (Vite + ShadCN) frontend. The system manages shared expenses among groups, computes net ...