Search
Search Results
-
Node connectivity augmentation via iterative randomized rounding
Many network design problems deal with the design of low-cost networks that are resilient to the failure of their elements (such as nodes or links)....
-
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms
When an infectious disease spreads, how to quickly vaccinate with a limited budget per time step to reduce the impact of the virus is very important....
-
Randomized rounding algorithms for large scale unsplittable flow problems
Unsplittable flow problems cover a wide range of telecommunication and transportation problems and their efficient resolution is key to a number of...
-
-
Relaxation and Rounding
The relaxation is a powerful technique to design approximation algorithms. It is similar to restriction, in terms of making a change on feasible...
-
A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
Randomized Kaczmarz-type methods are appealing for large-scale linear systems arising from big data problems. One of the keys of randomized...
-
The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
We show the existence of a net near the sphere, such that the values of any matrix on the sphere and on the net are compared via a regularized...
-
Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
In this paper, we discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The objective...
-
On Stochastic Roundoff Errors in Gradient Descent with Low-Precision Computation
When implementing the gradient descent method in low precision, the employment of stochastic rounding schemes helps to prevent stagnation of...
-
A fast randomized algorithm for computing an approximate null space
Randomized algorithms in numerical linear algebra can be fast, scalable and robust. This paper examines the effect of sketching on the right singular...
-
Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation...
-
Randomized Methods for Computing Optimal Transport Without Regularization and Their Convergence Analysis
The optimal transport (OT) problem can be reduced to a linear programming (LP) problem through discretization. In this paper, we introduced the...
-
Mechanism Design for Building Optimal Bridges Between Regions
We study the bridge-building problem from the mechanism design perspective. In this problem, a social planner is tasked with building a bridge to...
-
A 2-approximation for the bounded treewidth sparsest cut problem in \(\textsf{FPT}\) Time
In the non-uniform sparsest cut problem, we are given a supply graph G and a demand graph D , both with the same set of nodes V . The goal is to find a...
-
Maximizing products of linear forms, and the permanent of positive semidefinite matrices
We study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this...
-
A randomized heuristic repair for the multidimensional knapsack problem
The multidimensional knapsack problem (MKP) is an NP-hard combinatorial optimization problem whose solution consists of determining a subset of items...
-
Vertex downgrading to minimize connectivity
We consider the problem of interdicting a directed graph by deleting nodes with the goal of minimizing the local edge connectivity of the remaining...
-
-
Elements of the Computing Theory
This chapter is devoted to the further development of the theory of computational errors, namely, the work proposes a combined approach to assessing...
-
Achieving Long-Term Fairness in Submodular Maximization Through Randomization
Submodular function optimization is applied in ML and data analysis, including diverse dataset summarization. Fairness-aware algorithms are essential...