Nested and outlier embeddings into trees
Fuente:
arXiv
Guardado en:
| Autores principales: | Chawla, Shuchi, Sheridan, Kristin |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Brief announcement: A special case of maximum flow over time with network changes
por: Chawla, Shuchi, et al.
Publicado: (2026)
por: Chawla, Shuchi, et al.
Publicado: (2026)
Faster feasibility for dynamic flows and transshipments on temporal networks
por: Sheridan, Kristin, et al.
Publicado: (2024)
por: Sheridan, Kristin, et al.
Publicado: (2024)
Commitment Gap via Correlation Gap
por: Chawla, Shuchi, et al.
Publicado: (2025)
por: Chawla, Shuchi, et al.
Publicado: (2025)
Combinatorial Selection with Costly Information
por: Chawla, Shuchi, et al.
Publicado: (2024)
por: Chawla, Shuchi, et al.
Publicado: (2024)
Multi-Unit Combinatorial Prophet Inequalities
por: Chawla, Shuchi, et al.
Publicado: (2025)
por: Chawla, Shuchi, et al.
Publicado: (2025)
Engineering Data Reduction for Nested Dissection
por: Ost, Lara, et al.
Publicado: (2020)
por: Ost, Lara, et al.
Publicado: (2020)
Theoretical insights and an experimental comparison of tango trees and multi-splay trees
por: Al-Adhami, Khaleel, et al.
Publicado: (2024)
por: Al-Adhami, Khaleel, et al.
Publicado: (2024)
Binary weights spanning trees and the $k$-red spanning tree problem in linear time
por: Hochbaum, Dorit S.
Publicado: (2024)
por: Hochbaum, Dorit S.
Publicado: (2024)
Realizing temporal transportation trees
por: Mertzios, George B., et al.
Publicado: (2024)
por: Mertzios, George B., et al.
Publicado: (2024)
Fast decremental tree sums in forests
por: Berendsohn, Benjamin Aram, et al.
Publicado: (2026)
por: Berendsohn, Benjamin Aram, et al.
Publicado: (2026)
Spanning tree congestion of proper interval graphs
por: Otachi, Yota
Publicado: (2026)
por: Otachi, Yota
Publicado: (2026)
Grandchildren-weight-balanced binary search trees
por: Jugé, Vincent
Publicado: (2024)
por: Jugé, Vincent
Publicado: (2024)
Efficient top-down updates in AVL trees
por: Jugé, Vincent
Publicado: (2024)
por: Jugé, Vincent
Publicado: (2024)
Optimal bounds on a tree inference algorithm
por: Gardiner, Jack, et al.
Publicado: (2024)
por: Gardiner, Jack, et al.
Publicado: (2024)
Median and Small Parsimony Problems on RNA trees
por: Marchand, Bertrand, et al.
Publicado: (2024)
por: Marchand, Bertrand, et al.
Publicado: (2024)
Depth first representations of $k^2$-trees
por: Carmona, Gabriel, et al.
Publicado: (2025)
por: Carmona, Gabriel, et al.
Publicado: (2025)
Composing dynamic programming tree-decomposition-based algorithms
por: Baste, Julien
Publicado: (2019)
por: Baste, Julien
Publicado: (2019)
Parallel batch queries on dynamic trees: algorithms and experiments
por: Ikram, Humza, et al.
Publicado: (2025)
por: Ikram, Humza, et al.
Publicado: (2025)
A computational study of Gomory-Hu construction tree algorithms
por: Kolmogorov, Vladimir
Publicado: (2022)
por: Kolmogorov, Vladimir
Publicado: (2022)
Fast mixing in Ising models with a negative spectral outlier via Gaussian approximation
por: Mikulincer, Dan, et al.
Publicado: (2025)
por: Mikulincer, Dan, et al.
Publicado: (2025)
Kd-tree Based Wasserstein Distance Approximation for High-Dimensional Data
por: Teshigawara, Kanata, et al.
Publicado: (2026)
por: Teshigawara, Kanata, et al.
Publicado: (2026)
OrderedCuts: A new approach for computing Gomory-Hu tree
por: Kolmogorov, Vladimir
Publicado: (2022)
por: Kolmogorov, Vladimir
Publicado: (2022)
Constant-time edge label and leaf pointer maintenance on sliding suffix trees
por: Leonard, Laurentius, et al.
Publicado: (2023)
por: Leonard, Laurentius, et al.
Publicado: (2023)
Forcing a unique minimum spanning tree and a unique shortest path
por: Gima, Tatsuya, et al.
Publicado: (2025)
por: Gima, Tatsuya, et al.
Publicado: (2025)
Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework
por: Sena, Francisco, et al.
Publicado: (2026)
por: Sena, Francisco, et al.
Publicado: (2026)
Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
por: Lokshtanov, Daniel, et al.
Publicado: (2026)
por: Lokshtanov, Daniel, et al.
Publicado: (2026)
Finding the diameter of a tree with distance queries
por: Gerbner, Dániel, et al.
Publicado: (2025)
por: Gerbner, Dániel, et al.
Publicado: (2025)
Constructing disjoint Steiner trees in Sierpiński graphs
por: Yang, Chenxu, et al.
Publicado: (2023)
por: Yang, Chenxu, et al.
Publicado: (2023)
Graph parameters that are coarsely equivalent to tree-length
por: Dragan, Feodor F.
Publicado: (2025)
por: Dragan, Feodor F.
Publicado: (2025)
Generation of weighted trees, block trees and block graphs
por: Ekim, Tınaz, et al.
Publicado: (2024)
por: Ekim, Tınaz, et al.
Publicado: (2024)
A face cover perspective to $\ell_1$ embeddings of planar graphs
por: Filtser, Arnold
Publicado: (2019)
por: Filtser, Arnold
Publicado: (2019)
Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
por: Ould-Khessal, Nadir, et al.
Publicado: (2026)
por: Ould-Khessal, Nadir, et al.
Publicado: (2026)
Heights of butterfly trees
por: Peca-Medlin, John, et al.
Publicado: (2025)
por: Peca-Medlin, John, et al.
Publicado: (2025)
FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
por: Chen, Yuan, et al.
Publicado: (2025)
por: Chen, Yuan, et al.
Publicado: (2025)
Matching with Nested and Bundled Pandora Boxes
por: Bowers, Robin, et al.
Publicado: (2024)
por: Bowers, Robin, et al.
Publicado: (2024)
Elfs, trees and quantum walks
por: Apers, Simon, et al.
Publicado: (2022)
por: Apers, Simon, et al.
Publicado: (2022)
Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules
por: He, Xi, et al.
Publicado: (2025)
por: He, Xi, et al.
Publicado: (2025)
The Horton-Strahler number of butterfly trees
por: Peca-Medlin, John
Publicado: (2025)
por: Peca-Medlin, John
Publicado: (2025)
Convex Optimization with Nested Evolving Feasible Sets
por: M., Karthick Krishna, et al.
Publicado: (2026)
por: M., Karthick Krishna, et al.
Publicado: (2026)
Criteria for toroidal embedding of one-vertex ribbon graphs
por: Berezin, Tim
Publicado: (2022)
por: Berezin, Tim
Publicado: (2022)
Ejemplares similares
-
Brief announcement: A special case of maximum flow over time with network changes
por: Chawla, Shuchi, et al.
Publicado: (2026) -
Faster feasibility for dynamic flows and transshipments on temporal networks
por: Sheridan, Kristin, et al.
Publicado: (2024) -
Commitment Gap via Correlation Gap
por: Chawla, Shuchi, et al.
Publicado: (2025) -
Combinatorial Selection with Costly Information
por: Chawla, Shuchi, et al.
Publicado: (2024) -
Multi-Unit Combinatorial Prophet Inequalities
por: Chawla, Shuchi, et al.
Publicado: (2025)