Imagen de Portada

Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Plank, Benedikt M., Schewior, Kevin
Formato:	Preprint
Publicado:	2022
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation
por: Hellerstein, Lisa, et al.
Publicado: (2026)

Stochastic scheduling with Bernoulli-type jobs through policy stratification
por: Antoniadis, Antonios, et al.
Publicado: (2025)

Scheduling on a Stochastic Number of Machines
por: Buchem, Moritz, et al.
Publicado: (2024)

Quickly Determining Who Won an Election
por: Hellerstein, Lisa, et al.
Publicado: (2024)

Non-Adaptive Evaluation of $k$-of-$n$ Functions: Tight Gap and a Unit-Cost PTAS
por: Nielsen, Mads Anker, et al.
Publicado: (2025)

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

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
por: Soma, Tasuku, et al.
Publicado: (2025)

Threshold Testing and Semi-Online Prophet Inequalities
por: Hoefer, Martin, et al.
Publicado: (2023)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
por: Mendoza-Cadena, Mirabel, et al.
Publicado: (2026)

Automating the Search for Small Hard Examples to Approximation Algorithms
por: Sharma, Eklavya
Publicado: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
por: Zhao, Jingyang, et al.
Publicado: (2025)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
por: Chaplick, Steven, et al.
Publicado: (2024)

Designing Exploration Contracts
por: Hoefer, Martin, et al.
Publicado: (2024)

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
por: Dempsey, Jordan, et al.
Publicado: (2024)

Simple $k$-crashing Plan with a Good Approximation Ratio
por: Luo, Ruixi, et al.
Publicado: (2024)

A Simple Approximation Algorithm for Optimal Decision Tree
por: Zhuo, Zhengjia, et al.
Publicado: (2025)

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
por: Habib, Ruhan, et al.
Publicado: (2025)

Simple and Faster Algorithms for Knapsack
por: He, Qizheng, et al.
Publicado: (2023)

Approximating Small Sparse Cuts
por: Anand, Aditya, et al.
Publicado: (2024)

Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements
por: Yamano, Ryosuke, et al.
Publicado: (2026)

The Impact of Approximation on Algorithmic Progress
por: Li, Jeffery, et al.
Publicado: (2026)

Simple Algorithms for Fully Dynamic Edge Connectivity
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

A Simple Algorithm for Clustering Discrete Distributions
por: Mitra, Pradipta
Publicado: (2026)

A Simple Algorithm for Dynamic Carpooling with Recourse
por: Efron, Yuval, et al.
Publicado: (2024)

Simple and Optimal Sublinear Algorithms for Mean Estimation
por: Bertolotti, Beatrice, et al.
Publicado: (2024)

A Simple Algorithm for Trimmed Multipoint Evaluation
por: Fischer, Nick, et al.
Publicado: (2025)

A Simple and Fast Algorithm for Fair Cuts
por: Li, Jason, et al.
Publicado: (2024)

Identifying Approximate Minimizers under Stochastic Uncertainty
por: Al-Thani, Hessa, et al.
Publicado: (2025)

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
por: Ayad, Lorraine A. K., et al.
Publicado: (2023)

Forwarding Packets Greedily
por: Boyar, Joan, et al.
Publicado: (2026)

Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
por: Barak, Zohar, et al.
Publicado: (2026)

Approximation Algorithms for Steiner Connectivity Augmentation
por: Hathcock, Daniel, et al.
Publicado: (2023)

Improved Additive Approximation Algorithms for APSP
por: Jin, Ce, et al.
Publicado: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
por: Hermelin, Danny, et al.
Publicado: (2025)

Approximation Algorithms for Digraph Width Parameters
por: Kintali, Shiva, et al.
Publicado: (2011)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Scalable Algorithms for Approximate DNF Model Counting
por: Burkhardt, Paul, et al.
Publicado: (2026)

Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering
por: Adriaens, Florian, et al.
Publicado: (2026)

Hardness and Approximation Algorithms for Balanced Districting Problems
por: Dharangutte, Prathamesh, et al.
Publicado: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
por: Jansen, Klaus, et al.
Publicado: (2025)