Results 21 to 30 of about 996,357 (278)
A parameterized lower bounding method for the open capacitated arc routing problem
EURO Journal on Computational Optimization, 2023 Consider an undirected graph with demands scattered over the edges and a homogeneous fleet of vehicles to service the demands. In the open capacitated arc routing problem (OCARP) the objective is to find a set of routes that collectively service all ...
Rafael Kendy Arakaki +1 more
doaj +1 more source
Large Independent Sets on Random d-Regular Graphs with Fixed Degree d
Computation, 2023 The maximum independent set problem is a classic and fundamental combinatorial challenge, where the objective is to find the largest subset of vertices in a graph such that no two vertices are adjacent.
Raffaele Marino, Scott Kirkpatrick
doaj +1 more source
Two lower bounds for $p$-centered colorings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Given a graph $G$ and an integer $p$, a coloring $f : V(G) \to \mathbb{N}$ is \emph{$p$-centered} if for every connected subgraph $H$ of $G$, either $f$ uses more than $p$ colors on $H$ or there is a color that appears exactly once in $H$. The notion of $
Loïc Dubois +4 more
doaj +1 more source
Raising NP lower bounds to parallel NP lower bounds [PDF]
ACM SIGACT News, 1997 This issue's column surveys recent progress in raising NP-hardness lower bounds to parallel NP lower bounds. Complexity theorists will learn that Lewis Carroll (unbeknownst to himself) was a fellow complexity theorist. So that readers specializing in algorithms don't feel left out, let me mention that they are in even better company.
Hemaspaandra, Edith +2 more
openaire +2 more sources
Discrete Analysis, 2023 New lower bounds for cap sets, Discrete Analysis 2023:20, 18 pp. One of the best known problems in additive combinatorics, the cap set problem, asks how large a subset of $\mathbb F_3^n$ can be if it contains no non-trivial solutions to the equation $x ...
Fred Tyrrell
doaj +1 more source
Almost Periodic Solutions of First-Order Ordinary Differential Equations
Mathematics, 2018 Approaches to estimate the number of almost periodic solutions of ordinary differential equations are considered. Conditions that allow determination for both upper and lower bounds for these solutions are found.
Seifedine Kadry +3 more
doaj +1 more source
DLP in semigroups: Algorithms and lower bounds
Journal of Mathematical Cryptology, 2022 The discrete logarithm problem (DLP) in semigroups has attracted some interests and serves as the foundation of many cryptographic schemes. In this work, we study algorithms and lower bounds for DLP in semigroups.
Han Jiao, Zhuang Jincheng
doaj +1 more source
Resonances and lower resolvent bounds [PDF]
, 2014 We show how the presence of resonances close to the real axis implies exponential lower bounds on the norm of the cut-off resolvent on the real axis.Comment: 13 pages, 3 ...
Datchev, Kiril +2 more
core +1 more source
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
Applied Sciences, 2023 The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance criterion.
Christos Gogos
doaj +1 more source
Lower bounds in differential privacy [PDF]
, 2011 This is a paper about private data analysis, in which a trusted curator holding a confidential database responds to real vector-valued queries. A common approach to ensuring privacy for the database elements is to add appropriately generated random noise
C. Dwork +3 more
core +2 more sources