Results 21 to 30 of about 6,450,253 (299)
Approximation algorithms for the NFV service distribution problem [PDF]
IEEE Conference on Computer Communications, 2017 Distributed cloud networking builds on network functions virtualization (NFV) and software defined networking (SDN) to enable the deployment of network services in the form of elastic virtual network functions (VNFs) instantiated over general purpose ...
Hao Feng +4 more
semanticscholar +1 more source
Approximation Algorithms for Multitasking Scheduling Problems
IEEE Access, 2020 In this work, we incorporate human factors and real-life operations into newly proposed multitasking scheduling problems with periodic shift activities.
Feifeng Zheng +3 more
doaj +1 more source
Approximation Algorithms for Hitting Subgraphs [PDF]
, 2021 Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem is a special case of the hypergraph vertex cover problem on $k$-uniform hypergraphs, and thus admits an efficient ...
Noah Brüstle +4 more
openaire +2 more sources
Approximation Algorithms for Maximin Fair Division [PDF]
ACM Conference on Economics and Computation, 2017 We consider the problem of dividing indivisible goods fairly among n agents who have additive and submodular valuations for the goods. Our fairness guarantees are in terms of the maximin share, that is defined to be the maximum value that an agent can ...
Siddharth Barman, S. K. Murthy
semanticscholar +1 more source
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials [PDF]
Electron. Notes Discret. Math., 2016 We show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs.
Viresh Patel, Guus Regts
semanticscholar +1 more source
CES Transactions on Electrical Machines and Systems, 2022 The calculation of square roots is a frequently used operation in control systems of power electronics for different applications: motor drives, power converters, etc. At the same time, the execution of this procedure significantly loads microcontrollers
Anton Dianov +2 more
doaj +1 more source
Approximation Algorithms for Computing Maximin Share Allocations [PDF]
International Colloquium on Automata, Languages and Programming, 2015 We study the problem of computing maximin share allocations, a recently introduced fairness notion. Given a set of n agents and a set of goods, the maximin share of an agent is the best she can guarantee to herself, if she is allowed to partition the ...
Georgios Amanatidis +3 more
semanticscholar +1 more source
Greedy Algorithms for Optimal Distribution Approximation
Entropy, 2016 The approximation of a discrete probability distribution t by an M-type distribution p is considered. The approximation error is measured by the informational divergence D ( t ∥ p ) , which is an appropriate measure, e.g., in the ...
Bernhard C. Geiger, Georg Böcherer
doaj +1 more source
Influence Circle Covering in Large-Scale Social Networks: A Shift Approach
IEEE Access, 2021 Given a specific propagation speed $h$ in a social network $G(V, E)$ , an influence circle(IC) of a node $s$ in time $t$ is a node set of its influenced nodes, where the distance between $s$ and its expected influenced node $w$ is less than ...
Wangjun Ying, Jian Xu
doaj +1 more source
Improved Approximation Algorithms for k-Submodular Function Maximization [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2015 This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k-submodular functions. This improves upon the previous max{1/3, 1/(1 + a)}-approximation by Ward and Živný [18], where a = max{1, [EQUATION]}. We also show that
S. Iwata +2 more
semanticscholar +1 more source