This work exponentially improves upon the approximation ratio of an existing algo-rithm to 1 r +1, presents another novel dependent-rounding algorithm with an approximation ratio of 1 / ⌈ k 2 ⌉, and modify the initial algorithm via analytical scaling techniques to achieve an approximation factor of (1 − e − r ) /r.
This survey draws together the problem’s theoretical core – vertex, edge, face, list and total coloring – with the algorithms built to solve it and the industries that now depend on those algorithms.
Jisha Ann Abraham, C. Wilfred, Thomaskutty Stephen· International journal of com...· 0 citations
Small boundary (SB(k)), a family of linear-time greedy heuristics that guide vertex labeling through a prioritization scheme based on the structure of labeled and k levels of unlabeled vertex neighborhoods, is introduced.
S. G. D. de Oliveira, A. A. D. de Abreu· Journal of Heuristics· 0 citations
This paper generalises the existing PTAS for complete graphs from a fixed to an arbitrary number of intervals and disprove an existing conjecture, which states that every instance of BIA admits a solution satisfying at least three quarters of all edges.
PeterBlohm, FlorianChen, A. Gionis et al.· 0 citations
This paper presents an $\frac{11}{6} \approx 1.83$-competitive algorithm for trees in the more general edge arrival model and gives a 1.5-competitive algorithm and provide a matching lower bound.
Júlia Baligács, B. Bosek, Y. Disser et al.· Embedded Systems and Applica...· 1 citation
This work develops a parameterized approximation algorithm for Euclidean fair k-center clustering with an approximation ratio of 4.732 and designs a one-pass streaming algorithm with an approximation ratio of 4.42, outperforming the state-of-the-art ratio.
Ze-Yu Lin, Chaoqi Jia, Long-Kun Guo et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
