Results 41 to 50 of about 129,306 (313)
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
Approximation Algorithms for $\ell_0$-Low Rank Approximation
CoRR, 2017 We study the $\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\|A'-A\|_0$ is minimized. Here, for a matrix $B$, $\|B\|_0$ denotes the number of its non-zero entries.
Bringmann, K. ; https://orcid.org/0000-0003-1356-5177 +2 more
openaire +4 more sources
Approximate Discrete Reconstruction Algorithm [PDF]
Fundamenta Informaticae, 2013 Discrete tomography deals with tomographic reconstruction of greyscale images for which the set of possible grey levels is discrete and small. Here, we develop a discrete approximate reconstruction algorithm. Our algorithm computes an image that has only grey values belonging to a given finite set.
K.J. Batenburg (Joost) +2 more
openaire +4 more sources
Clustering Affine Subspaces: Algorithms and Hardness [PDF]
, 2012 We study a generalization of the famous k-center problem where each object is an affine subspace of dimension Δ, and give either the first or significantly improved algorithms and hardness results for many combinations of parameters.
Lee, Euiwoong
core +1 more source
Approximation Algorithms for Intersection Graphs [PDF]
Algorithmica, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Kammer, Torsten Tholey
openaire +3 more sources
Special Issue on Graph Algorithms
Algorithms, 2013 This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Jesper Jansson
doaj +1 more source
Approximation Algorithms for Scheduling with Reservations
Algorithmica, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Diedrich, Florian +3 more
openaire +3 more sources
Algorithms and error bounds for multivariate piecewise constant approximation
, 2010 We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewise constants. This covers for example the Sobolev-Poincar´e inequalities, parts of the theory of nonlinear approximation, Haar wavelets and tree ...
Oleg Davydov, Davydov, Oleg
core +1 more source
Counting With Tinytable: Every Bit Counts!
IEEE Access, 2019 Bloom filters are space efficient data structures that support approximate membership queries. They are easily extensible but incur significant overheads when extended to support additional functionality, such as removals or counting.
Gil Einziger, Roy Friedman
doaj +1 more source
Minimizing Travel Time and Latency in Multi-Capacity Ride-Sharing Problems
Algorithms, 2022 Motivated by applications in ride-sharing and truck-delivery, we study the problem of matching a number of requests and assigning them to cars. A number of cars are given, each of which consists of a location and a speed, and a number of requests are ...
Kelin Luo, Frits C. R. Spieksma
doaj +1 more source