Imagen de Portada

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Shigemizu, Mika, Suzuki, Toshio, Usami, Koki
Formato:	Preprint
Publicado:	2018
Materias:	Data Structures and Algorithms 68T20, 68W40 I.2.8; F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Many Objective Problems Where Crossover is Provably Essential
por: Opris, Andre
Publicado: (2024)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
por: Sopp, Braeden, et al.
Publicado: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)

Naively Sorting Evolving Data is Optimal and Robust
por: Giakkoupis, George, et al.
Publicado: (2024)

Optimizing Genetic Algorithms Using the Binomial Distribution
por: Cicirello, Vincent A.
Publicado: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
por: Chen, Zongchen, et al.
Publicado: (2022)

PPSZ is better than you think
por: Scheder, Dominik
Publicado: (2022)

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
por: Alpay, Faruk, et al.
Publicado: (2026)

NP-membership for the boundary-boundary art-gallery problem
por: Stade, Jack
Publicado: (2025)

The Distributional Tail of Worst-Case Quickselect
por: Płecha, Witold
Publicado: (2026)

Open Source Evolutionary Computation with Chips-n-Salsa
por: Cicirello, Vincent A.
Publicado: (2024)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
por: Hougardy, Stefan, et al.
Publicado: (2025)

Multi-Party Multi-Objective Optimization as Consensus Search: Runtime Analysis of Cross-Party Recombination
por: Fang, Xiaolei, et al.
Publicado: (2026)

How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025)

String 2-Covers with No Length Restrictions
por: Boneh, Itai, et al.
Publicado: (2024)

Fast FPT Algorithms for Grundy Number on Dense Graphs
por: Nezhad, Sina Ghasemi, et al.
Publicado: (2024)

Minimum-cost paths for electric cars
por: Dorfman, Dani, et al.
Publicado: (2024)

Hairpin Completion Distance Lower Bound
por: Boneh, Itai, et al.
Publicado: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
por: An, Hyung-Chan, et al.
Publicado: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
por: Filmus, Yuval, et al.
Publicado: (2024)

Maximizing Diversity in (near-)Median String Selection
por: Chakraborty, Diptarka, et al.
Publicado: (2026)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
por: Crochemore, Maxime, et al.
Publicado: (2025)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
por: Zhong, Xianghui
Publicado: (2019)

Strongly Sublinear Algorithms for Testing Pattern Freeness
por: Newman, Ilan, et al.
Publicado: (2021)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
por: Shlyk, Vasiliy S.
Publicado: (2026)

Evolving A* to Efficiently Solve the k Shortest-Path Problem (Extended Version)
por: López, Carlos Linares, et al.
Publicado: (2024)

Strengths and Limitations of Greedy in Cup Games
por: Jasińska, Kalina, et al.
Publicado: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

The Power of Filling in Balanced Allocations
por: Los, Dimitrios, et al.
Publicado: (2022)

Mean-Biased Processes for Balanced Allocations
por: Los, Dimitrios, et al.
Publicado: (2023)

Dual-Step Optimization for Binary Sequences with High Merit Factors
por: Pšeničnik, Blaž, et al.
Publicado: (2024)

Optimal non-adaptive algorithm for edge estimation
por: Bishnu, Arijit, et al.
Publicado: (2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
por: Hommelsheim, Felix
Publicado: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
por: Bosch-Calvo, Miguel, et al.
Publicado: (2023)

Separation and Collapse of Equilibria Inequalities on AND-OR Trees without Shape Constraints
por: Ito, Fuki, et al.
Publicado: (2024)

Counting HyperGraphlets via Color Coding: a Quadratic Barrier and How to Break It
por: Bressan, Marco, et al.
Publicado: (2026)

Fairness in the k-Server Problem
por: Daneshvaramoli, Mohammadreza, et al.
Publicado: (2025)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
por: Sun, Hao
Publicado: (2023)