Cover Image

A Framework for Algorithm Stability

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Meulemans, Wouter, Speckmann, Bettina, Verbeek, Kevin, Wulms, Jules
Format:	Preprint
Published:	2017
Subjects:	Data Structures and Algorithms Computational Geometry F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
by: Gálvez, Waldo, et al.
Published: (2025)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
by: Jansson, Jesper, et al.
Published: (2024)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
by: Gudmundsson, Joachim, et al.
Published: (2021)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
by: Le, Hung, et al.
Published: (2021)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
by: Fekete, Sándor P., et al.
Published: (2024)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
by: Fekete, Sándor P., et al.
Published: (2025)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
by: Brankovic, Milutin, et al.
Published: (2021)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
by: de Berg, Mark, et al.
Published: (2026)

Online Maximum Independent Set of Hyperrectangles
by: Advani, Rishi, et al.
Published: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
by: Grandoni, Fabrizio, et al.
Published: (2024)

Structure and Independence in Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
by: Gudmundsson, Joachim, et al.
Published: (2021)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
by: Deligkas, Argyrios, et al.
Published: (2026)

Guarding Polyominoes Under $k$-Hop Visibility
by: Filtser, Omrit, et al.
Published: (2023)

Sliding Squares in Parallel
by: Akitaya, Hugo A., et al.
Published: (2024)

Guarding Offices with Maximum Dispersion
by: Fekete, Sándor P., et al.
Published: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
by: Aichholzer, Oswin, et al.
Published: (2026)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
by: Fekete, Sándor P., et al.
Published: (2024)

Planar Network Diversion
by: Bentert, Matthias, et al.
Published: (2025)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
by: Elbassioni, Khaled
Published: (2025)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)

Efficiently Reconfiguring a Connected Swarm of Labeled Robots
by: Fekete, Sándor P., et al.
Published: (2022)

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
by: Becker, Aaron T., et al.
Published: (2025)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)

Line Cover and Related Problems
by: Bentert, Matthias, et al.
Published: (2025)

A Faster Directed Single-Source Shortest Path Algorithm
by: Duan, Ran, et al.
Published: (2026)

Streaming Algorithms for Bin Packing and Vector Scheduling
by: Cormode, Graham, et al.
Published: (2019)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
by: Goldenberg, Elazar, et al.
Published: (2022)

New Sorting Algorithm Wave Sort (W-Sort)
by: Wei, Jia Xu
Published: (2025)

A Piecewise Approach for the Analysis of Exact Algorithms
by: Clinch, Katie, et al.
Published: (2024)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
by: Chuzhoy, Julia, et al.
Published: (2025)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
by: Chakrabarti, Amit, et al.
Published: (2024)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
by: Goswami, Mayank, et al.
Published: (2022)

On Solving Simple Curved Nonograms
by: Löffler, Maarten, et al.
Published: (2025)

Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)

An Algorithm for a Variation of the Shortest Common Superstring Problem
by: Gilfanov, Arthur
Published: (2024)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
by: Haeupler, Bernhard, et al.
Published: (2024)

Approximation Algorithms for Action-Reward Query-Commit Matching
by: Derakhshan, Mahsa, et al.
Published: (2026)