Image de couverture de livre

When is local search both effective and efficient?

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kaznatcheev, Artem, Alferez, Sofia Vazquez
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Discrete Mathematics Populations and Evolution
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Local search for valued constraint satisfaction parameterized by treedepth
par: Kaznatcheev, Artem
Publié: (2024)

Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four
par: Kaznatcheev, Artem, et autres
Publié: (2024)

Galled Perfect Transfer Networks
par: Sánchez, Alitzel López, et autres
Publié: (2024)

All ascents exponential from valued constraint graphs of pathwidth three
par: Kaznatcheev, Artem, et autres
Publié: (2026)

When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
par: Huber, Katharina T., et autres
Publié: (2024)

Greed is slow on sparse graphs of oriented valued constraints
par: Kaznatcheev, Artem, et autres
Publié: (2025)

Analysis of Phylogeny Tracking Algorithms for Serial and Multiprocess Applications
par: Moreno, Matthew Andres, et autres
Publié: (2024)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
par: Mestel, David, et autres
Publié: (2024)

Graph-based method for constructing consensus trees
par: Torquet, Elio, et autres
Publié: (2025)

phylo2vec: a library for vector-based phylogenetic tree manipulation
par: Scheidwasser, Neil, et autres
Publié: (2025)

Meeting times on graphs in near-cubic time
par: McAvoy, Alex
Publié: (2026)

LvD: A New Algorithm for Computing the Likelihood of a Phylogeny
par: Bryant, David, et autres
Publié: (2026)

Bayesian Credible Sets for Phylogenetic Tree Topologies with Applications to Coverage Analysis and Cross-Model Comparison
par: Klawitter, Jonathan, et autres
Publié: (2025)

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

Constant delay Gray code enumeration of ideals and antichains in posets
par: Brenner, Sofia, et autres
Publié: (2026)

Functional design of efficient and parallelizable combinatorial generators using convolution
par: He, Xi, et autres
Publié: (2025)

On multidimensional generalization of binary search
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
par: Komusiewicz, Christian, et autres
Publié: (2026)

Parameterized Complexity of s-Club Cluster Edge Deletion: When Is the Diameter Bound Necessary?
par: Gaikwad, Ajinkya
Publié: (2025)

Reconstructing semi-directed level-1 networks using few quarnets
par: Frohn, Martin, et autres
Publié: (2024)

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
par: Draesslerová, Dominika, et autres
Publié: (2024)

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
par: van Iersel, Leo, et autres
Publié: (2026)

Snakes and Ladders: a Treewidth Story
par: Chaplick, Steven, et autres
Publié: (2023)

Random local access for sampling k-SAT solutions
par: Dong, Dingding, et autres
Publié: (2024)

Spaces of ranked tree-child networks
par: Moulton, Vincent, et autres
Publié: (2024)

The Path-Label Reconciliation (PLR) Dissimilarity Measure for Gene Trees
par: Sánchez, Alitzel López, et autres
Publié: (2024)

Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints
par: Ebert, Patricia A., et autres
Publié: (2026)

Embedding phylogenetic trees in networks of low treewidth
par: van Iersel, Leo, et autres
Publié: (2022)

Weighted Food Webs Make Computing Phylogenetic Diversity So Much Harder
par: Schestag, Jannik
Publié: (2025)

A branch-&-price approach to the unrooted maximum agreement forest problem
par: Frohn, Martin, et autres
Publié: (2024)

On the existence of funneled orientations for classes of rooted phylogenetic networks
par: Döcker, Janosch, et autres
Publié: (2024)

Phylogenetic Inference under the Balanced Minimum Evolution Criterion via Semidefinite Programming
par: Skums, P.
Publié: (2026)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)

Improved bounds for coloring locally sparse hypergraphs
par: Iliopoulos, Fotis
Publié: (2020)

Sink-free orientations: a local sampler with applications
par: Anand, Konrad, et autres
Publié: (2025)

Zero-free regions and concentration inequalities for hypergraph colorings in the local lemma regime
par: Liu, Jingcheng, et autres
Publié: (2026)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
par: Tan, Jingjing
Publié: (2024)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Generation of weighted trees, block trees and block graphs
par: Ekim, Tınaz, et autres
Publié: (2024)