Copertina

Random-Order Online Independent Set of Intervals and Hyperrectangles

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Garg, Mohit, Kar, Debajyoti, Khan, Arindam
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Computational Geometry 68W27, 68W20, 68W25
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Shortest Paths without a Map, but with an Entropic Regularizer
di: Bubeck, Sébastien, et al.
Pubblicazione: (2022)

Building a Nest by an Automaton
di: Czyzowicz, Jurek, et al.
Pubblicazione: (2019)

Strongly Sublinear Algorithms for Testing Pattern Freeness
di: Newman, Ilan, et al.
Pubblicazione: (2021)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
di: Friggstad, Zachary, et al.
Pubblicazione: (2018)

Incremental-Decremental Maximization
di: Disser, Yann, et al.
Pubblicazione: (2025)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

On the Advice Complexity of Online Unit Clustering
di: Nagy-György, Judit
Pubblicazione: (2023)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
di: Borodin, Allan, et al.
Pubblicazione: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
di: Grobben, Kobe, et al.
Pubblicazione: (2025)

Quasi-optimal hierarchically semi-separable matrix approximation
di: Amsel, Noah, et al.
Pubblicazione: (2025)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
di: Gribelyuk, Elena, et al.
Pubblicazione: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
di: Hung, Chia-Yang, et al.
Pubblicazione: (2024)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
di: Andreou, Pantelis, et al.
Pubblicazione: (2024)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
di: Gupta, Swati, et al.
Pubblicazione: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
di: Gupta, Swati, et al.
Pubblicazione: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
di: Gupta, Swati, et al.
Pubblicazione: (2023)

Stochastic Function Certification with Correlations
di: Ghuge, Rohan, et al.
Pubblicazione: (2026)

The Telephone $k$-Multicast Problem
di: Hathcock, Daniel, et al.
Pubblicazione: (2024)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
di: Bai, Miao, et al.
Pubblicazione: (2023)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
di: Simmons, Miles, et al.
Pubblicazione: (2025)

Optimal Online Bipartite Matching in Degree-2 Graphs
di: Bhangale, Amey, et al.
Pubblicazione: (2025)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
di: Bansal, Ishan, et al.
Pubblicazione: (2024)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
di: Simmons, Miles, et al.
Pubblicazione: (2026)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
di: Liu, Bowen
Pubblicazione: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
di: Sopp, Braeden, et al.
Pubblicazione: (2026)

Improved Approximation Algorithms for the Expanding Search Problem
di: Griesbach, Svenja M., et al.
Pubblicazione: (2023)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
di: Gu, Qian-Ping, et al.
Pubblicazione: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
di: Hougardy, Stefan, et al.
Pubblicazione: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
di: Feldman, Moran, et al.
Pubblicazione: (2026)

Robust Classification of Dynamic Bichromatic point Sets in R2
di: Glazenburg, Erwin, et al.
Pubblicazione: (2024)

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
di: Chiclana, Rafael, et al.
Pubblicazione: (2025)

Many Objective Problems Where Crossover is Provably Essential
di: Opris, Andre
Pubblicazione: (2024)

On Distributed Colouring of Hyperbolic Random Graphs
di: Maus, Yannic, et al.
Pubblicazione: (2025)

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
di: Rokhlin, Dmitry B., et al.
Pubblicazione: (2025)

Naively Sorting Evolving Data is Optimal and Robust
di: Giakkoupis, George, et al.
Pubblicazione: (2024)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
di: Gupta, Swati, et al.
Pubblicazione: (2026)

Optimal Discretization is Fixed-parameter Tractable
di: Kratsch, Stefan, et al.
Pubblicazione: (2020)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
di: Ito, Takehiro, et al.
Pubblicazione: (2024)