Suchergebnisse - "Approximation algorithms"

Parallel-batch scheduling with rejection: Structural properties and approximation algorithms von Ou, Jinwen, Lu, Lingfa, Zhong, Xueling

“… )-approximation algorithm with a complexity of O(nlogn).•An efficient PTAS with a complexity of O …”
Volltext

Efficient approximation algorithms for scheduling moldable tasks von Wu, Xiaohu, Loiseau, Patrick

“… •We study scheduling independent moldable tasks under the proposed (δj,kj)-monotonic model, whose generality is between the classic monotonic and …”
Volltext

Improved Approximation Algorithms for Index Coding von Chawin, Dror, Haviv, Ishay

“… The index coding problem is concerned with broadcasting encoded information to a collection of receivers in a way that enables each receiver to discover its …”
Volltext

Efficient approximation algorithms for adaptive influence maximization von Huang, Keke, Tang, Jing, Han, Kai, Xiao, Xiaokui, Chen, Wei, Sun, Aixin, Tang, Xueyan, Lim, Andrew

“… Given a social network G and an integer k , the influence maximization (IM) problem asks for a seed set S of k nodes from G to maximize the expected number of …”
Volltext

Approximation Algorithms for Mobile Data Caching in Small Cell Networks von Poularakis, Konstantinos, Iosifidis, George, Tassiulas, Leandros

“… Small cells constitute a promising solution for managing the mobile data growth that has overwhelmed network operators. Local caching of popular content items …”
Volltext

Approximation Algorithms for Model-Based Compressive Sensing von Hegde, Chinmay, Indyk, Piotr, Schmidt, Ludwig

“… Compressive sensing (CS) states that a sparse signal can be recovered from a small number of linear measurements, and that this recovery can be performed …”
Volltext

Approximation algorithms for flexible graph connectivity von Boyd, Sylvia, Cheriyan, Joseph, Haddadan, Arash, Ibrahimpur, Sharat

“… We present approximation algorithms for several network design problems in the model of flexible graph connectivity (Adjiashvili et al., in: IPCO, pp 13 …”
Volltext

Parameterized approximation algorithms for weighted vertex cover von Mandal, Soumen, Misra, Pranabendu, Rai, Ashutosh, Saurabh, Saket

“… )-bi-criteria approximation algorithm for (k,W)-Vertex Cover either produces a vertex cover S such that |S|≤ak and w …”
Volltext

Exact and approximation algorithms for routing a convoy through a graph: Exact and approximation algorithms for routing a convoy through a graph von van Ee, Martijn, Oosterwijk, Tim, Sitters, René, Wiese, Andreas

“… We study routing problems of a convoy in a graph, generalizing the shortest path problem (SPP), the travelling salesperson problem (TSP), and the Chinese …”
Volltext

Approximation Algorithms for Training One-Node ReLU Neural Networks von Dey, Santanu S., Wang, Guanyi, Xie, Yao

“… In this paper, we begin by proving the NP-hardness of the ON-ReLU problem. We then present an approximation algorithm to solve the ON-ReLU problem, whose running time …”
Volltext

A survey of exact and approximation algorithms for linear-parametric optimization problems: A survey of exact and approximation algorithms von Nemesch, Levin, Ruzika, Stefan, Thielen, Clemens, Wittmann, Alina

“… Linear-parametric optimization, where multiple objectives are combined into a single objective using linear combinations with parameters as coefficients, has …”
Volltext

Approximation algorithms for the k+-star packing problem von Huang, Zhihua, Zhang, An, Gao, Mingqi, Sun, Jiayi, Chen, Yong

“… Given a target graph G and a set G of k+-stars, that is, stars with at least k satellites, a k+-star packing of G is a set of vertex-disjoint subgraphs of G …”
Volltext

Solving High-Order Portfolios via Successive Convex Approximation Algorithms von Zhou, Rui, Palomar, Daniel P.

“… The first moment and second central moments of the portfolio return, a.k.a. mean and variance, have been widely employed to assess the expected profit and risk …”
Volltext

Approximation Algorithms for Charging Reward Maximization in Rechargeable Sensor Networks via a Mobile Charger von Weifa Liang, Zichuan Xu, Wenzheng Xu, Jiugen Shi, Guoqiang Mao, Das, Sajal K.

“… Wireless energy transfer has emerged as a promising technology for wireless sensor networks to power sensors with controllable yet perpetual energy. In this …”
Volltext

Machine Learning Approximation Algorithms for High-Dimensional Fully Nonlinear Partial Differential Equations and Second-order Backward Stochastic Differential Equations von Beck, Christian, E, Weinan, Jentzen, Arnulf

“… High-dimensional partial differential equations (PDEs) appear in a number of models from the financial industry, such as in derivative pricing models, credit …”
Volltext

Improved approximation algorithms for k -submodular maximization under a knapsack constraint von Ha, Dung T.K., Pham, Canh V., Tran, Tan D.

Volltext

Improved Approximation Algorithms for Bounded-Degree Local Hamiltonians von Anshu, Anurag, Gosset, David, Morenz Korol, Karen J., Soleimanifar, Mehdi

“… The low-temperature properties of interacting quantum systems are believed to require exponential resources to compute in the general case. Quantifying the …”
Volltext

Approximation algorithms for hard capacitated k-facility location problems von Aardal, Karen, van den Berg, Pieter L., Gijswijt, Dion, Li, Shanfei

“… •Approximation algorithms for two variants of CKFL by utilizing the extreme solutions.•An improved approximation algorithm for CFL with uniform opening costs …”
Volltext

Approximation algorithms for orthogonal line centers von Das, Arun Kumar, Das, Sandip, Mukherjee, Joydeep

“… A 2-factor approximation algorithm and a (53,32) bi-criteria approximation algorithm is presented for the problem …”
Volltext

Approximation algorithms for clustering with dynamic points von Deng, Shichuan, Li, Jian, Rabani, Yuval

“… of points and the movement cost of centers, or to minimize one subject to some constraints on the other. We obtain a constant-factor approximation algorithm for dynamic ordered k-median under mild assumptions on the input …”
Volltext