Search Results - k‐additive approximation algorithm

Exact and approximate algorithms for clustering problem in wireless sensor networks by Yarinezhad, Ramin, Hashemi, Seyed Naser

“… The authors show that LBCP can be solved by a k-additive approximation algorithm with a running time of $ 2^{O({k}/{\log k})}+O(n) $2O(k/log⁡k)+O(n…”
Get full text

Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing by Guoliang Xue, Weiyi Zhang, Jian Tang, Thulasiraman, K.

“… This problem is NP-hard and is commonly modeled using a graph with n vertices and m edges with K additive QoS parameters associated with each edge. For the case of K…”
Get full text

Finding a Path Subject to Many Additive QoS Constraints by Guoliang Xue, Sen, A., Weiyi Zhang, Jian Tang, Thulasiraman, K.

“… We model this problem using a graph with n vertices and m edges with K additive QoS parameters associated with each edge, for any constant Kges2…”
Get full text

List-Coloring Graphs without Subdivisions and without Immersions by Kawarabayashi, Ken-ichi, Kobayashi, Yusuke

“…A graph G contains a subdivision of H if G contains a subgraph which is isomorphic to a graph that can be obtained from H by subdividing some edges. A graph H…”
Get full text

Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs by Chakraborty, Dibyayan, Vaxès, Yann

“… Our main contribution in this paper is to provide an additive O(δ)-approximation algorithm for k-Geodesic Center on δ-hyperbolic graphs…”
Get full text

Multiconstrained QoS Routing: A Norm Approach by Xue, Guoliang, Kami Makki, S.

“…) problem, where one seeks a source-destination path satisfying K \ge 2 additive QoS constraints in a network with K additive QoS parameters…”
Get full text

Approximation algorithms for facility location and k-median with differential privacy by Wang, Lu, Feng, Qilong, Wang, Jianxin

“… For the k-median problem, our local search-based framework yields an approximation algorithm with a multiplicative error of 4+ε…”
Get full text

Combinatorial Assortment Optimization by Immorlica, Nicole, Lucier, Brendan, Mao, Jieming, Syrgkanis, Vasilis, Tzamos, Christos

“…Assortment optimization refers to the problem of designing a slate of products to offer potential customers, such as stocking the shelves in a convenience…”
Get full text

Fast & Space-Efficient Approximations of Language Edit Distance and RNA Folding: An Amnesic Dynamic Programming Approach by Saha, Barna

“… As a result, we obtain fast small-space approximation algorithms for the fundamental problems of context free grammar recognition…”
Get full text

Algorithms for Finding a Maximum Non- k -Linked Graph by Kobayashi, Yusuke, Yoshida, Yuichi

“… In this paper, we give the first polynomial-time algorithm for the case of $k=2$, whereas a similar problem to find a maximum induced subgraph without 2-vertex-disjoint paths connecting fixed terminal pairs is NP-hard…”
Get full text

Geometric Algorithms for Learning and Data Poisoning by Fan, Bohan

“…Geometric methods have provided many powerful tools in algorithm design and learning…”
Get full text

One-Pass Additive-Error Subset Selection for ℓp Subspace Approximation and (k, p)-Clustering by Deshpande, Amit, Pratap, Rameshwar

“… p subspace approximation, previously known subset selection algorithms based on volume sampling and adaptive sampling proposed in Deshpande and Varadarajan (STOC’07, 2007…”
Get full text

Parameterized approximation of dominating set problems by Downey, Rodney G., Fellows, Michael R., McCartin, Catherine, Rosamond, Frances

“… We show that there is no such FPT algorithm for g ( k ) of the form k + c (where c is a fixed constant, termed an additive FPT approximation), unless FPT = W [ 2…”
Get full text

Computational complexity and approximability of social welfare optimization in multiagent resource allocation by Nguyen, Nhan-Tam, Nguyen, Trung Thanh, Roos, Magnus, Rothe, Jörg

“… of resources, where utilities can be represented in the bundle form, the k -additive form, and as straight-line programs…”
Get full text

A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation by Nguyen, Trung Thanh, Roos, Magnus, Rothe, Jörg

“…Multiagent resource allocation provides mechanisms to allocate bundles of resources to agents, where resources are assumed to be indivisible and nonshareable…”
Get full text

Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products by Sarlos, Tamas, Song, Xingyou, Woodruff, David, Qiuyi, Zhang

“…Inspired by fast algorithms in natural language processing, we study low rank approximation in the entrywise transformed setting where we want to find a good…”
Get full text

How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals by Cicalese, Ferdinando, Gargano, Luisa, Vaccaro, Ugo

“… Since the optimization problem is known to be NP-hard, we give an efficient algorithm to find a joint probability distribution in \({\cal C}({\bf p}, {\bf…”
Get full text

The Telephone \(k\)-Multicast Problem by Hathcock, Daniel, Kortsarz, Guy, Ravi, R

“…We consider minimum time multicasting problems in directed and undirected graphs: given a root node and a subset of \(t\) terminal nodes, multicasting seeks to…”
Get full text

Matching with sizes (or scheduling with processing set restrictions) by Biró, Péter, McDermid, Eric

“… We survey the close relationship between these two problems, and give new approximation algorithms for the (NP-hard…”
Get full text

Replicable Clustering by Esfandiari, Hossein, Karbasi, Amin, Mirrokni, Vahab, Velegkas, Grigoris, Zhou, Felix

“…We design replicable algorithms in the context of statistical clustering under the recently introduced notion of replicability from Impagliazzo et al. [2022…”
Get full text