Search
Search Results
-
Algorithms and Hardness for Metric Dimension on Digraphs
In the Metric Dimension problem, one asks for a minimum-size set R of vertices such that for any pair of vertices of the graph, there is a vertex...
-
Fair allocation algorithms for indivisible items under structured conflict constraints
We consider the fair allocation of indivisible items to several agents with additional conflict constraints. These are represented by a conflict...
-
Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables
The proof of convergence of adaptive discretization-based algorithms for semi-infinite programs (SIPs) usually relies on compact host sets for the...
-
Algorithms for Contractibility of Compressed Curves on 3-Manifold Boundaries
In this paper we prove that the problem of deciding contractibility of an arbitrary closed curve on the boundary of a 3-manifold is in NP . We...
-
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Multimarginal Optimal Transport (MOT) has attracted significant interest due to applications in machine learning, statistics, and the sciences....
-
Lax-Oleinik-Type Formulas and Efficient Algorithms for Certain High-Dimensional Optimal Control Problems
Two of the main challenges in optimal control are solving problems with state-dependent running costs and develo** efficient numerical solvers that...
-
-
-
Generating Faster Algorithms for d-Path Vertex Cover
Many algorithms which exactly solve hard problems require branching on more or less complex structures in order to do their job. Those who design...
-
Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs
The Restricted Subset Feedback Vertex Set problem (R-SFVS) takes a graph $$G = (V,...
-
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
An intensive line of research on fixed parameter tractability of integer programming is focused on exploiting the relation between the sparsity of a...
-
Parameterized algorithms and complexity for the traveling purchaser problem and its variants
The traveling purchaser problem (TPP), a generalization of the traveling salesman problem, is to determine a tour of suppliers and purchase needed...
-
Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms
We consider minimizing the sum of three convex functions, where the first one F is smooth, the second one is nonsmooth and proximable and the third...
-
Proximal Gradient Algorithms Under Local Lipschitz Gradient Continuity
Composite optimization offers a powerful modeling tool for a variety of applications and is often numerically solved by means of proximal gradient...
-
New low-rank optimization model and algorithms for spectral compressed sensing
In this paper, we investigate the recovery of an undamped spectrally sparse signal and its spectral components from a set of regularly spaced samples...
-
Complexity and Algorithms for Domination in Graphs
In this chapter,we provide an overviewof some of the core results on NP-completeness and algorithms for domination, independent domination, and total...
-
Nonlinear acceleration of momentum and primal-dual algorithms
We describe convergence acceleration schemes for multistep optimization algorithms where the underlying fixed-point operator is not symmetric. In...
-
Fast Parallel Algorithms for Submodular p-Superseparable Maximization
Maximizing a non-negative, monontone, submodular function \(f\) over...
-
Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem
For the first time, algorithms with constant performance guarantees are substantiated for a series of asymmetric routing problems of combinatorial...
-
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More
For a hereditary graph class \(\mathcal {H}\) , the...