Search Results - "Parameterized Approximation Algorithms"

Parameterized Approximation Schemes for Clustering with General Norm Objectives by Abbasi, Fateme, Banerjee, Sandip, Byrka, Jaroslaw, Chalermsook, Parinya, Gadekar, Ameet, Khodamoradi, Kamyar, Marx, Daniel, Sharma, Roohani, Spoerhase, Joachim

“…This paper considers the well-studied algorithmic regime of designing a (1+\epsilon)-approximation algorithm for a k-clustering problem that runs in time…”
Get full text

Approximation Algorithms for Intersection Graphs by Kammer, Frank, Tholey, Torsten

“…We study three complexity parameters that, for each vertex v , are an upper bound for the number of cliques that are sufficient to cover a subset S ( v ) of…”
Get full text

On the Shallow-Light Steiner Tree Problem by Longkun Guo, Kewen Liao, Hong Shen

“…Let G = (V, E) be a given graph with nonnegative integral edge cost and delay, S ⊆ V be a terminal set and r ∈ S be the selected root. The shallow-light…”
Get full text