Cover Image

A simple and efficient preprocessing step for convex hull problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Heydari, Mohammad, Khalifeh, Ashkan
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A k-swap Local Search for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)

Smoothed Analysis of the k-Swap Neighborhood for Makespan Scheduling
by: Rohwedder, Lars, et al.
Published: (2024)

An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
by: Liu, Gangli
Published: (2024)

Testing whether a subgraph is convex or isometric
by: Cabello, Sergio
Published: (2025)

A simple $(2+ε)$-approximation for knapsack interdiction
by: Weninger, Noah
Published: (2026)

A more efficient algorithm to compute the Rand Index for change-point problems
by: Prates, Lucas de Oliveira
Published: (2021)

Fast and simple unrooted dynamic forests
by: Berendsohn, Benjamin Aram
Published: (2023)

New simple and fast quicksort algorithm for equal keys
by: Afereidoon, Parviz
Published: (2025)

Dynamic framework for edge-connectivity maintenance of simple graphs
by: Wrobel, Blazej
Published: (2026)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
by: Gupta, Sushmita, et al.
Published: (2025)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
by: Tsin, Yung H.
Published: (2023)

A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs
by: Fox, Emily
Published: (2023)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

A Simple Analysis of Ranking in General Graphs
by: Derakhshan, Mahsa, et al.
Published: (2025)

Simple and efficient four-cycle counting on sparse graphs
by: Burkhardt, Paul, et al.
Published: (2023)

Round-efficient Fully-scalable MPC algorithms for k-Means
by: Jiang, Shaofeng H. -C., et al.
Published: (2026)

Computing the LZ-End parsing: Easy to implement and practically efficient
by: Dinklage, Patrick
Published: (2024)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
by: He, Xi, et al.
Published: (2023)

On the closest pair of points problem
by: Hitz, Martin, et al.
Published: (2026)

Prize-Collecting Steiner Tree: A 1.79 Approximation
by: Ahmadi, Ali, et al.
Published: (2024)

A short note about the learning-augmented secretary problem
by: Choo, Davin, et al.
Published: (2024)

Approximate $2$-hop neighborhoods on incremental graphs: An efficient lazy approach
by: Becchetti, Luca, et al.
Published: (2025)

Space/time-efficient RDF stores based on circular suffix sorting
by: Brisaboa, Nieves R., et al.
Published: (2020)

Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
by: Yang, Connor, et al.
Published: (2025)

The self-concordant perceptron is efficient on a sub-family feasibility instances
by: Chan-Hon-Tong, Adrien
Published: (2019)

Structured Downsampling for Fast, Memory-efficient Curation of Online Data Streams
by: Moreno, Matthew Andres, et al.
Published: (2024)

The trace reconstruction problem for spider graphs
by: Sun, Alec, et al.
Published: (2022)

Approximating the shortest path problem with scenarios
by: Kasperski, Adam, et al.
Published: (2018)

Space-efficient Data Structure for Next/Previous Larger/Smaller Value Queries
by: Jo, Seungbum, et al.
Published: (2022)

Space-efficient SLP encoding for $O(\log N)$-time random access
by: Takasaka, Akito, et al.
Published: (2024)

Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars
by: Olbrich, Jannik
Published: (2025)

Improved Approximation for Ranking on General Graphs
by: Derakhshan, Mahsa, et al.
Published: (2025)

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
by: Armbruster, Alexander, et al.
Published: (2025)

A Fair and Memory/Time-efficient Hashmap
by: Asudeh, Abolfazl, et al.
Published: (2023)

Algorithms for the local and the global postage stamp problem
by: Palais, Léo Colisson, et al.
Published: (2026)

Approximating optimization problems in graphs with locational uncertainty
by: Bougeret, Marin, et al.
Published: (2022)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
by: Azarmehr, Amir, et al.
Published: (2024)

The graph alignment problem: fundamental limits and efficient algorithms
by: Ganassali, Luca
Published: (2024)

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time
by: Mahabadi, Sepideh, et al.
Published: (2025)

Faster algorithms for packing forests in graphs and related problems
by: Arkhipov, Pavel, et al.
Published: (2024)