Cover Image

Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Riad, Md. Rawha Siddiqi, Rahat, Md. Tanzeem, Hasan, Md. Manzurul
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Competitive Analysis of Online Facility Assignment Algorithms on Discrete Grid Graphs: Performance Bounds and Remediation Strategies
by: Alif, Lamya, et al.
Published: (2026)

Online Facility Assignments on Polygons
by: Malik, Sumaiya, et al.
Published: (2025)

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach
by: Rahat, Md. Tanzeem, et al.
Published: (2025)

Permutation Matching Under Parikh Budgets: Linear-Time Detection, Packing, and Disjoint Selection
by: Shanto, MD Nazmul Alam, et al.
Published: (2026)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
by: Rahat, Md Tanzeem, et al.
Published: (2025)

The Power of Greedy for Online Minimum Cost Matching on the Line
by: Balkanski, Eric, et al.
Published: (2022)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
by: Eppstein, David
Published: (2025)

The Online Submodular Assignment Problem
by: Hathcock, Daniel, et al.
Published: (2024)

The Online Submodular Assignment Problem
by: Hathcock, Daniel, et al.
Published: (2024)

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
by: Duvignau, Romaric, et al.
Published: (2024)

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

Greedy Dynamic Matching
by: Arnosti, Nick, et al.
Published: (2025)

Simple Grid Polygon Online Exploration Revisited
by: Brock, Maximilian, et al.
Published: (2024)

Online Sorting and Translational Packing of Convex Polygons
by: Aamand, Anders, et al.
Published: (2021)

New Greedy Spanners and Applications
by: Popova, Elizaveta, et al.
Published: (2026)

From Dynamic Programs to Greedy Algorithms
by: van Melkebeek, Dieter
Published: (2025)

Greedy BST on Permutation Initial Tree
by: Pareek, Akash
Published: (2024)

Online General Knapsack with Reservation Costs
by: Burjons, Elisabet, et al.
Published: (2025)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
by: Dhar, Saurav, et al.
Published: (2024)

Engineering Algorithms for Dynamic Greedy Set Cover
by: Uzrad, Amitai
Published: (2026)

Greedy Completion for Weighted $(α,β)$-Spanners
by: Tzalik, Elad
Published: (2026)

An Improved Greedy Approximation for (Metric) $k$-Means
by: Charikar, Moses, et al.
Published: (2026)

Multiagent Matroid Upgrading: Greedy is Fair and Efficient
by: Ma, Qingwen, et al.
Published: (2026)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
by: Basiak, Mateusz, et al.
Published: (2025)

Online Matching with Delays and Size-based Costs
by: Kawase, Yasushi, et al.
Published: (2024)

Potential-Based Greedy Matching for Dynamic Delivery Pooling
by: Ma, Hongyao, et al.
Published: (2025)

A Lossless Deamortization for Dynamic Greedy Set Cover
by: Solomon, Shay, et al.
Published: (2024)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
by: Chen, Wenjing, et al.
Published: (2023)

Simple Construction of Greedy Trees and Greedy Permutations
by: Chubet, Oliver, et al.
Published: (2024)

Maximum Coverage $k$-Antichains and Chains: A Greedy Approach
by: Cáceres, Manuel, et al.
Published: (2025)

Discrete Effort Distribution via Regret-enabled Greedy Algorithm
by: Cao, Song, et al.
Published: (2025)

Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
by: Nikolaev, Maksim
Published: (2024)

A Unified Framework for Analysis of Randomized Greedy Matching Algorithms
by: Derakhshan, Mahsa, et al.
Published: (2026)

Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs
by: Azar, Yossi, et al.
Published: (2025)

Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
by: Hébert-Johnson, Úrsula, et al.
Published: (2025)

Greedy matroid base packings with applications to dynamic graph density and orientations
by: Arkhipov, Pavel, et al.
Published: (2025)

A Simple Average-case Analysis of Recursive Randomized Greedy MIS
by: Dalirrooyfard, Mina, et al.
Published: (2026)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
by: Li, Bowen, et al.
Published: (2024)

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
by: Kuo, Tung-Wei
Published: (2024)

Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
by: Meierhans, Simon, et al.
Published: (2025)