| 651 |
Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
Shi Li
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 652 |
Untangling Graphs on Surfaces
Éric Colin de Verdière, Vincent Despré, Loïc Dubois
|
👻
Ghosted
|
cs.CG
|
5 |
2 years ago |
| 653 |
Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
Sujoy Bhore, Arnold Filtser, Csaba D. Tóth
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 654 |
Breaking the k/log k Barrier in Collective Tree Exploration via Tree-Mining
Romain Cosson
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 655 |
Adversarial Low Degree Testing
Dor Minzer, Kai Zhe Zheng
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 656 |
Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
David G. Harris
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 657 |
Factoring Pattern-Free Permutations into Separable ones
Édouard Bonnet, Romain Bourneuf, ... (+2 more)
|
🔮
The Ethereal
|
math.CO
|
5 |
2 years ago |
| 658 |
On the hardness of finding balanced independent sets in random bipartite graphs
Will Perkins, Yuzhou Wang
|
👻
Ghosted
|
cs.DS
|
5 |
2 years ago |
| 659 |
Sparse induced subgraphs in P_6-free graphs
Maria Chudnovsky, Rose McCarty, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 660 |
Smoothed Complexity of SWAP in Local Graph Partitioning
Xi Chen, Chenghao Guo, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 661 |
The Sharp Power Law of Local Search on Expanders
Simina Brânzei, Davin Choo, Nicholas Recker
|
🔮
The Ethereal
|
cs.CC
|
5 |
3 years ago |
| 662 |
Uniformity Testing over Hypergrids with Subcube Conditioning
Xi Chen, Cassandra Marcussen
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 663 |
Balanced Allocations with Heterogeneous Bins: The Power of Memory
Dimitrios Los, Thomas Sauerwald, John Sylvester
|
🔮
The Ethereal
|
cs.DM
|
5 |
3 years ago |
| 664 |
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond
Martin Nägele, Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 665 |
Approximation Algorithms and Hardness for Strong Unique Games
Suprovat Ghoshal, Anand Louis
|
👻
Ghosted
|
cs.DS
|
5 |
6 years ago |
| 666 |
Online Multiserver Convex Chasing and Optimization
Sébastien Bubeck, Yuval Rabani, Mark Sellke
|
👻
Ghosted
|
cs.DS
|
5 |
6 years ago |
| 667 |
A Fast Minimum Degree Algorithm and Matching Lower Bound
Robert Cummings, Matthew Fahrbach, Animesh Fatehpuria
|
👻
Ghosted
|
cs.DS
|
5 |
6 years ago |
| 668 |
Lossless Prioritized Embeddings
Michael Elkin, Ofer Neiman
|
👻
Ghosted
|
cs.DS
|
5 |
7 years ago |
| 669 |
Round Complexity of Common Randomness Generation: The Amortized Setting
Noah Golowich, Madhu Sudan
|
👻
Ghosted
|
cs.IT
|
5 |
6 years ago |
| 670 |
Quantifying the Burden of Exploration and the Unfairness of Free Riding
Christopher Jung, Sampath Kannan, Neil Lutz
|
👻
Ghosted
|
cs.LG
|
5 |
7 years ago |
| 671 |
Efficiently list-edge coloring multigraphs asymptotically optimally
Fotis Iliopoulos, Alistair Sinclair
|
🔮
The Ethereal
|
cs.DM
|
5 |
7 years ago |
| 672 |
Non-Empty Bins with Simple Tabulation Hashing
Anders Aamand, Mikkel Thorup
|
👻
Ghosted
|
cs.DS
|
5 |
7 years ago |
| 673 |
Local Flow Partitioning for Faster Edge Connectivity
Monika Henzinger, Satish Rao, Di Wang
|
👻
Ghosted
|
cs.DS
|
5 |
9 years ago |
| 674 |
Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube
Paul Beame, Cyrus Rashtchian
|
👻
Ghosted
|
cs.DS
|
5 |
9 years ago |
| 675 |
Approximately Sampling Elements with Fixed Rank in Graded Posets
Prateek Bhakta, Ben Cousins, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
5 |
9 years ago |
| 676 |
Tight Network Topology Dependent Bounds on Rounds of Communication
Arkadev Chattopadhyay, Michael Langberg, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
5 |
9 years ago |
| 677 |
How to Round Subspaces: A New Spectral Clustering Algorithm
Ali Kemal Sinop
|
👻
Ghosted
|
cs.DS
|
5 |
11 years ago |
| 678 |
Sublinear-Time Algorithms for Max Cut, Max E2Lin$(q)$, and Unique Label Cover on Expanders
Pan Peng, Yuichi Yoshida
|
👻
Ghosted
|
cs.DS
|
5 |
3 years ago |
| 679 |
Spencer's theorem in nearly input-sparsity time
Vishesh Jain, Ashwin Sah, Mehtaab Sawhney
|
👻
Ghosted
|
cs.DS
|
5 |
4 years ago |
| 680 |
Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
Sander Borst, Marek Eliáš, Moritz Venzin
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 681 |
Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs
Benjamin Moseley, Aidin Niaparast, R. Ravi
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 682 |
Fixed-Parameter Tractability of Hedge Cut
Fedor V. Fomin, Petr A. Golovach, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 683 |
Relative-error monotonicity testing
Xi Chen, Anindya De, ... (+5 more)
|
🔮
The Ethereal
|
cs.CC
|
4 |
1 year ago |
| 684 |
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
Sven Jäger, Alexander Lindermayr, Nicole Megow
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 685 |
Quasi-Monte Carlo Beyond Hardy-Krause
Nikhil Bansal, Haotian Jiang
|
👻
Ghosted
|
cs.DS
|
4 |
1 year ago |
| 686 |
Congestion-Approximators from the Bottom Up
Jason Li, Satish Rao, Di Wang
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 687 |
Near-optimal hierarchical matrix approximation from matrix-vector products
Tyler Chen, Feyza Duman Keles, ... (+4 more)
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 688 |
A Lower Bound for Light Spanners in General Graphs
Greg Bodwin, Jeremy Flics
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 689 |
Approximating Traveling Salesman Problems Using a Bridge Lemma
Martin Böhm, Zachary Friggstad, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 690 |
Cactus Representation of Minimum Cuts: Derandomize and Speed up
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 691 |
Bin Packing under Random-Order: Breaking the Barrier of 3/2
Anish Hebbar, Arindam Khan, K. V. N. Sreenivas
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 692 |
Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts
Zhongtian He, Shang-En Huang, Thatchaphol Saranurak
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 693 |
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation
Alina Harbuzova, Ce Jin, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 694 |
Robust Sparsification for Matroid Intersection with Applications
Chien-Chung Huang, François Sellier
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 695 |
Online Robust Mean Estimation
Daniel M. Kane, Ilias Diakonikolas, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
4 |
2 years ago |
| 696 |
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem
Nick Fischer
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 697 |
Single-Source Unsplittable Flows in Planar Graphs
Vera Traub, Laura Vargas Koch, Rico Zenklusen
|
👻
Ghosted
|
cs.DS
|
4 |
2 years ago |
| 698 |
Lipschitz Continuous Algorithms for Covering Problems
Soh Kumabe, Yuichi Yoshida
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 699 |
Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems
Zongchen Chen
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |
| 700 |
Edge-Coloring Algorithms for Bounded Degree Multigraphs
Abhishek Dhawan
|
👻
Ghosted
|
cs.DS
|
4 |
3 years ago |