Suchergebnisse - k‐additive approximation algorithm

Exact and approximate algorithms for clustering problem in wireless sensor networks von 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 …”
Volltext

Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing von 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 …”
Volltext

Finding a Path Subject to Many Additive QoS Constraints von 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 …”
Volltext

List-Coloring Graphs without Subdivisions and without Immersions von 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 …”
Volltext

Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs von 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 …”
Volltext

Multiconstrained QoS Routing: A Norm Approach von 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 …”
Volltext

Approximation algorithms for facility location and k-median with differential privacy von 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+ε …”
Volltext

Combinatorial Assortment Optimization von 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 …”
Volltext

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

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

Algorithms for Finding a Maximum Non- k -Linked Graph von 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 …”
Volltext

Geometric Algorithms for Learning and Data Poisoning von Fan, Bohan

“… Geometric methods have provided many powerful tools in algorithm design and learning …”
Volltext

One-Pass Additive-Error Subset Selection for ℓp Subspace Approximation and (k, p)-Clustering von 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 …”
Volltext

Parameterized approximation of dominating set problems von 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 …”
Volltext

Computational complexity and approximability of social welfare optimization in multiagent resource allocation von 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 …”
Volltext

A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation von 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 …”
Volltext

Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products von 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 …”
Volltext

How to Find a Joint Probability Distribution of Minimum Entropy (almost) given the Marginals von 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 …”
Volltext

The Telephone \(k\)-Multicast Problem von 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 …”
Volltext

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

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

Replicable Clustering von 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 …”
Volltext