Results 21 to 30 of about 561,904 (322)
FPT algorithms to recognize well covered graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Given a graph $G$, let $vc(G)$ and $vc^+(G)$ be the sizes of a minimum and a maximum minimal vertex covers of $G$, respectively. We say that $G$ is well covered if $vc(G)=vc^+(G)$ (that is, all minimal vertex covers have the same size).
Rafael Araujo +4 more
doaj +1 more source
Fast Diameter Computation within Split Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 When can we compute the diameter of a graph in quasi linear time? We address this question for the class of {\em split graphs}, that we observe to be the hardest instances for deciding whether the diameter is at most two.
Guillaume Ducoffe +2 more
doaj +1 more source
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time [PDF]
TheoretiCSIn this work we revisit the elementary scheduling problem $1||\sum p_j U_j$. The goal is to select, among $n$ jobs with processing times and due dates, a subset of jobs with maximum total processing time that can be scheduled in sequence without ...
Nick Fischer, Leo Wennmann
doaj +1 more source
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method [PDF]
TheoretiCSThe simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by Spielman and Teng
Sophie Huiberts +2 more
doaj +1 more source
3SUM in Preprocessed Universes: Faster and Simpler [PDF]
TheoretiCSWe revisit the 3SUM problem in the \emph{preprocessed universes} setting. We present an algorithm that, given three sets $A$, $B$, $C$ of $n$ integers, preprocesses them in quadratic time, so that given any subsets $A' \subseteq A$, $B' \subseteq B$, $C'
Shashwat Kasliwal +2 more
doaj +1 more source
Improved Combinatorial Approximations for Weighted Correlation Clustering [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe present combinatorial approximation algorithms for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of vertices, denoting their difference and similarity.
Mojtaba Ostovari, Alireza Zarei
doaj +1 more source
Parameterized Power Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a positive integer demand.
Eric Angel +3 more
doaj +1 more source
TheoretiCSWe introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial $P(X)$ on a set of variables $X=\{x_1,\ldots,x_n\}$ and a linear matroid $M=(X,\mathcal{I})$ of rank $k$, both over a field
Eduard Eiben +2 more
doaj +1 more source
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry [PDF]
ACM Symposium on Parallelism in Algorithms and Architectures, 2018 In this paper, we design parallel write-efficient geometric algorithms that perform asymptotically fewer writes than standard algorithms for the same problem.
G. Blelloch +3 more
semanticscholar +1 more source
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We initiate the study of a new problem on searching and fetching in a distributed environment concerning treasure-evacuation from a unit disk. A treasure and an exit are located at unknown positions on the perimeter of a disk and at known arc distance. A
Konstantinos Georgiou +2 more
doaj +1 more source