Image de couverture de livre

Simple Construction of Greedy Trees and Greedy Permutations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chubet, Oliver, Sheehy, Don, Sheth, Siddharth
Format:	Preprint
Publié:	2024
Sujets:	Computational Geometry Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient Greedy Discrete Subtrajectory Clustering
par: van der Hoog, Ivor, et autres
Publié: (2025)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
par: Eppstein, David
Publié: (2025)

Greedy BST on Permutation Initial Tree
par: Pareek, Akash
Publié: (2024)

Greedy Dynamic Matching
par: Arnosti, Nick, et autres
Publié: (2025)

A Simple Average-case Analysis of Recursive Randomized Greedy MIS
par: Dalirrooyfard, Mina, et autres
Publié: (2026)

New Greedy Spanners and Applications
par: Popova, Elizaveta, et autres
Publié: (2026)

Visibility Queries in Simple Polygons
par: Bhore, Sujoy, et autres
Publié: (2026)

From Dynamic Programs to Greedy Algorithms
par: van Melkebeek, Dieter
Publié: (2025)

Dynamic Convex Hulls for Simple Paths
par: Brewer, Bruce, et autres
Publié: (2024)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
par: Li, Bowen, et autres
Publié: (2024)

Simple Grid Polygon Online Exploration Revisited
par: Brock, Maximilian, et autres
Publié: (2024)

Submodular Maximization under Supermodular Constraint: Greedy Guarantees
par: Srivastava, Ajitesh, et autres
Publié: (2026)

Engineering Algorithms for Dynamic Greedy Set Cover
par: Uzrad, Amitai
Publié: (2026)

Greedy Completion for Weighted $(α,β)$-Spanners
par: Tzalik, Elad
Publié: (2026)

An Improved Greedy Approximation for (Metric) $k$-Means
par: Charikar, Moses, et autres
Publié: (2026)

Multiagent Matroid Upgrading: Greedy is Fair and Efficient
par: Ma, Qingwen, et autres
Publié: (2026)

Lower Bounds for Greedy Teaching Set Constructions
par: Compton, Spencer, et autres
Publié: (2025)

Exact Algorithms for Clustered Planarity with Linear Saturators
par: Da Lozzo, Giordano, et autres
Publié: (2024)

Simple Compact Monotone Tree Drawings
par: Oikonomou, Anargyros, et autres
Publié: (2017)

A Lossless Deamortization for Dynamic Greedy Set Cover
par: Solomon, Shay, et autres
Publié: (2024)

Potential-Based Greedy Matching for Dynamic Delivery Pooling
par: Ma, Hongyao, et autres
Publié: (2025)

The Power of Greedy for Online Minimum Cost Matching on the Line
par: Balkanski, Eric, et autres
Publié: (2022)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
par: Chen, Wenjing, et autres
Publié: (2023)

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
par: Huang, Lingxiao, et autres
Publié: (2022)

On the Exponential Growth of Geometric Shapes
par: Almalki, Nada, et autres
Publié: (2023)

Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
par: Nikolaev, Maksim
Publié: (2024)

Maximum Coverage $k$-Antichains and Chains: A Greedy Approach
par: Cáceres, Manuel, et autres
Publié: (2025)

Discrete Effort Distribution via Regret-enabled Greedy Algorithm
par: Cao, Song, et autres
Publié: (2025)

A Unified Framework for Analysis of Randomized Greedy Matching Algorithms
par: Derakhshan, Mahsa, et autres
Publié: (2026)

Weakly Leveled Planarity with Bounded Span
par: Bekos, Michael, et autres
Publié: (2024)

Laminar Matroid Secretary: Greedy Strikes Back
par: Huang, Zhiyi, et autres
Publié: (2023)

Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
par: Nekrich, Yakov, et autres
Publié: (2026)

Greedy matroid base packings with applications to dynamic graph density and orientations
par: Arkhipov, Pavel, et autres
Publié: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

ResQue Greedy: Rewiring Sequential Greedy for Improved Submodular Maximization
par: Gallart, Joan Vendrell, et autres
Publié: (2025)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks
par: Garcia, Javier, et autres
Publié: (2025)

Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)
par: Riad, Md. Rawha Siddiqi, et autres
Publié: (2025)

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
par: Mitrović, Slobodan, et autres
Publié: (2026)

A Deterministic Partition Tree and Applications
par: Wang, Haitao
Publié: (2025)

Bifurcation: How to Explore a Tree
par: Har-Peled, Sariel
Publié: (2025)