Results 21 to 30 of about 742,132 (325)
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
Connected bin packing problem on traceable graphs [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2022 We consider a new extension of the bin packing problem in which a set of connectivity constraints should be satisfied. An undirected graph with a weight function on the nodes is given.
A. Nejoomi, A. Dolati
doaj +1 more source
On Approximating Multi-Criteria TSP [PDF]
, 2009 We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP).
Manthey, Bodo
core +11 more sources
Coresets for the Average Case Error for Finite Query Sets
Sensors, 2021 Coreset is usually a small weighted subset of an input set of items, that provably approximates their loss function for a given set of queries (models, classifiers, hypothesis). That is, the maximum (worst-case) error over all queries is bounded.
Alaa Maalouf +3 more
doaj +1 more source
Odd-flavor Hybrid Monte Carlo Algorithm for Lattice QCD [PDF]
, 2001 We discuss hybrid Monte Carlo algorithms for odd-flavor lattice QCD simulations. The algorithms include a polynomial approximation which enables us to simulate odd-flavor QCD in the framework of the hybrid Monte Carlo algorithm.
de Forcrand, Philippe, Takaishi, Tetsuya
core +2 more sources
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling
Algorithms, 2019 For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications.
Qinghai Li, Chang Wu Yu
doaj +1 more source
Additive Approximation Algorithms for Modularity Maximization [PDF]
, 2016 The modularity is a quality function in community detection, which was introduced by Newman and Girvan (2004). Community detection in graphs is now often conducted through modularity maximization: given an undirected graph $G=(V,E)$, we are asked to find
Kawase, Yasushi +2 more
core +2 more sources
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2012 We consider a repetitive routing problem of a single grasp-and-delivery robot used on a printed circuit board (PCB) assembly line. The robot arranges n identical pins from their current configuration to the next required one by transferring at most one ...
Aleksandar SHURBEVSKI +2 more
doaj +1 more source
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
, 2018 As massive graphs become more prevalent, there is a rapidly growing need for scalable algorithms that solve classical graph problems, such as maximum matching and minimum vertex cover, on large datasets.
Assadi, Sepehr +4 more
core +1 more source
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights
Algorithms, 2016 In the pursuit of finding subclasses of the makespan minimization problem on unrelated parallel machines that have approximation algorithms with approximation ratio better than 2, the graph balancing problem has been of current interest.
Daniel R. Page, Roberto Solis-Oba
doaj +1 more source