Image de couverture de livre

A Gentle Wakeup Call: Symmetry Breaking with Less Collision Cost

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Biswas, Umesh, Young, Maxwell
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Collision-Free Robot Scheduling
par: Adamson, Duncan, et autres
Publié: (2024)

satsuma: Structure-based Symmetry Breaking in SAT
par: Anders, Markus, et autres
Publié: (2024)

Adaptive Hashing: Faster Hash Functions with Fewer Collisions
par: Melis, Gábor
Publié: (2026)

Collision-free Exploration by Mobile Agents Using Pebbles
par: Das, Sajal K., et autres
Publié: (2024)

Breaking the $T^{2/3}$ Barrier for Sequential Calibration
par: Dagan, Yuval, et autres
Publié: (2024)

Word Break on SLP-Compressed Texts
par: De, Rajat, et autres
Publié: (2025)

Breaking the Bellman-Ford Shortest-Path Bound
par: Elmasry, Amr
Publié: (2024)

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
par: Cruciani, Emilio, et autres
Publié: (2025)

Symmetry-breaking symmetry in directed spectral partitioning
par: Pasadakis, Dimosthenis, et autres
Publié: (2025)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
par: Cohen, Edith, et autres
Publié: (2025)

Sequential Testing with Subadditive Costs
par: Harris, Blake, et autres
Publié: (2025)

Combinatorial Selection with Costly Information
par: Chawla, Shuchi, et autres
Publié: (2024)

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
par: Kothalawala, Buddhi, et autres
Publié: (2026)

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
par: Abrahamsen, Mikkel
Publié: (2024)

Bin Packing under Random-Order: Breaking the Barrier of 3/2
par: Hebbar, Anish, et autres
Publié: (2024)

Online General Knapsack with Reservation Costs
par: Burjons, Elisabet, et autres
Publié: (2025)

Cost-Free Neutrality for the River Method
par: Döring, Michelle, et autres
Publié: (2025)

Cost-Driven Data Replication with Predictions
par: Zuo, Tianyu, et autres
Publié: (2024)

Less is More: Faster Maximum Clique Search by Work-Avoidance
par: Vandierendonck, Hans
Publié: (2025)

Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut
par: Chuzhoy, Julia, et autres
Publié: (2025)

Breaking a Long-Standing Barrier: 2-$\varepsilon$ Approximation for Steiner Forest
par: Ahmadi, Ali, et autres
Publié: (2025)

Breaking the Barrier $2^k$ for Subset Feedback Vertex Set in Chordal Graphs
par: Bai, Tian, et autres
Publié: (2022)

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-$f$ Time Barrier
par: Bukov, Anton, et autres
Publié: (2023)

Hardness of Approximation for Shortest Path with Vector Costs
par: Carlson, Charlie, et autres
Publié: (2025)

Minimum-Peak-Cost Flows Over Time
par: Anapolska, Mariia, et autres
Publié: (2025)

Cost Preserving Dependent Rounding for Allocation Problems
par: Rohwedder, Lars, et autres
Publié: (2025)

Low-Cost Arborescence Under Edge Faults
par: Dey, Dipan, et autres
Publié: (2026)

Online Matching with Delays and Size-based Costs
par: Kawase, Yasushi, et autres
Publié: (2024)

Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
par: Baswana, Surender, et autres
Publié: (2025)

Faster $(Δ+ 1)$-Edge Coloring: Breaking the $m \sqrt{n}$ Time Barrier
par: Bhattacharya, Sayan, et autres
Publié: (2024)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
par: Basiak, Mateusz, et autres
Publié: (2025)

Additive One Approximation for Minimum Degree Spanning Tree: Breaking the $O(mn)$ Time Barrier
par: Bhattacharya, Sayan, et autres
Publié: (2026)

Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
par: Peng, Pan, et autres
Publié: (2025)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
par: Zhu, Yanhui, et autres
Publié: (2024)

The Power of Greedy for Online Minimum Cost Matching on the Line
par: Balkanski, Eric, et autres
Publié: (2022)

Estimating Correlation Clustering Cost in Node-Arrival Stream
par: Liu, Kaiwen, et autres
Publié: (2026)

Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
par: Turoczy, Alexander, et autres
Publié: (2025)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
par: Chen, Yixin, et autres
Publié: (2025)

An Algorithmic Approach to Address Course Enrollment Challenges
par: Biswas, Arpita, et autres
Publié: (2023)

Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs
par: Azar, Yossi, et autres
Publié: (2025)