-
501
Construction and Maintenance of Wireless Mobile Backbone Networks
Published 2011“…Then, we focus on the two subproblems and present a number of distributed approximation algorithms that maintain a solution to the GDC problem under mobility. …”
Get full text
Get full text
Article -
502
Sparse covers for sums of indicators
Published 2015“…We discuss the implications of our construction for approximation algorithms and the computation of approximate Nash equilibria in anonymous games.…”
Get full text
Get full text
Article -
503
Algorithms and Hardness for Approximating the Diameter of a Graph
Published 2022“…For these variants, we develop both approximation algorithms and conditional lower bounds, that are often tight.…”
Get full text
Thesis -
504
The Traveling Salesman Problem for Systems with Dynamic Constraints
Published 2023“…As this problem is well-known to be NP-hard, it is usually solved using heuristics or approximation algorithms. An important variant of the TSP is the Dynamic TSP (DTSP), in which the targets exist in a space in which the agent’s trajectory must satisfy dynamic constraints (for instance, limited ability to accelerate). …”
Get full text
Get full text
Thesis -
505
Performance comparisons of greedy algorithms in compressed sensing
Published 2015“…Compressed sensing has motivated the development of numerous sparse approximation algorithms designed to return a solution to an underdetermined system of linear equations where the solution has the fewest number of nonzeros possible, referred to as the sparsest solution. …”
Journal article -
506
Algorithmic aspects of mean–variance optimization in Markov decision processes
Published 2017“…We finally offer pseudopolynomial exact and approximation algorithms.…”
Get full text
Get full text
Article -
507
Mean-Variance Optimization in Markov Decision Processes
Published 2013“…We finally offer pseudo-polynomial exact and approximation algorithms.…”
Get full text
Get full text
Article -
508
An Integer Linear Programming Model for Solving Radio Mean Labeling Problem
Published 2020-01-01“…The second contribution is proposing an approximate algorithm which finds an upper bound for radio mean number of a given graph. …”
Get full text
Article -
509
A Multi-Phase Method for Euclidean Traveling Salesman Problems
Published 2022-08-01“…Both general the TSP and its Euclidean version are strongly NP-hard. Hence, approximation algorithms with a good practical behavior are of primary interest. …”
Get full text
Article -
510
Proving prediction prudence
Published 2022-09-01“…The test methods presented are mainly specified as bootstrap and normal approximation algorithms. The tests are general but can be applied in particular in the area of credit risk,both for regulatory and accounting purposes.…”
Get full text
Article -
511
Bus Scheduling as a Graph Coloring Problem
Published 2003-12-01“…However, no polynomial algorithms have been found for generalizations of VSP and hence the graph coloring formulation offers good approximation algorithms for their solution.…”
Get full text
Article -
512
Cookie Clicker
Published 2021“…While simple to state, the game gives rise to interesting analysis involving ideas from NP-hardness, approximation algorithms, and dynamic programming.…”
Get full text
Article -
513
-
514
-
515
-
516
cheduling uniform machines with restricted assignment
Published 2022-07-01“…There exist 4/3-approximation algorithms for the cases of inclusive and tree-hierarchical assignment restrictions, under an assumption that machines with higher capabilities also run at higher speeds. …”
Get full text
Article -
517
On Transformation of a Logical Circuit to a Circuit with NAND and NOR Gates Only
Published 2018-08-01“…In the paper the quick approximation algorithms of the circuit transformation are proposed, minimizing number of the inverters. …”
Get full text
Article -
518
Physical education of students in the framework of inclusive education
Published 2023-11-01“…The authors give an approximate algorithm for organizing a collective inclusive physical education class.…”
Get full text
Article -
519
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games
Published 2020“…We then give approximation algorithms for the problem of finding a (u; p)-maxmin strategy for these games. …”
Get full text
Book -
520
Efficient target control of complex networks based on preferential matching.
Published 2017-01-01“…Existing works present an approximate algorithm to find the input nodes used to control partial nodes of the network. …”
Get full text
Article