Titlebook: LATIN 2024: Theoretical Informatics; 16th Latin American José A. Soto,Andreas Wiese Conference proceedings 2024 The Editor(s) (if applicab

CALL

flutter

Wheeler Mapstext .[1...] and an assignment of tags to the characters of . such that we can preprocess a pattern .[1...] and then, given . and ., quickly return all the distinct tags labeling the first characters of the occurrences of .[....] in .. For the applications that most interest us, characters with long

残酷的地方

Faster Combinatorial ,-Clique Algorithmse ., where . is the exponent of Boolean matrix multiplication. To date, this is the only technique capable of beating the trivial . bound by a polynomial factor. Due to this technique’s various limitations, much effort has gone into designing “combinatorial” algorithms that improve over exhaustive s

知道

On Approximate Colored Path Counting of the number, ., of distinct colors assigned to nodes in a query path. We first present data structures that can compute a 2-approximate answer, i.e., a number in ., and achieve three different time/space trade-offs: i) an .(.)-word structure with . query time for any constant ., ii) an .-word str

删减

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournamentsgraph. Lokshtanov et al. [TALG ‘21] gave a factor 2 randomized approximation algorithm for finding a minimum weight FVS in tournaments. We generalize the result by presenting a factor . randomized approximation algorithm for finding a minimum weight FVS in digraphs of independence number .; a genera

exclusice

丰富

Competitive Searching over Terrainst point on the surface of the terrain. The searcher starts on the surface of the terrain and is allowed to fly above the terrain. The goal is to devise a searching strategy that minimizes the ., that is, the worst-case ratio between the distance traveled by the searching strategy and the minimum tra

Charlatan

Computing Largest Minimum Color-Spanning Intervals of Imprecise Pointsat it can be solved in . time when ., by exploiting several structural properties of candidate solutions, combined with a number of advanced algorithmic techniques. Interestingly, this shows a sharp contrast with the 2-dimensional version of the problem, recently shown to be NP-hard.

vertebrate

Confirm