3 citations · 4 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling
Spencer Compton, Slobodan Mitrović, Ronitt Rubinfeld
Interval scheduling is a basic problem in the theory of algorithms and a classical task in combinatorial optimization. We develop a set of techniques for partitioning and grouping…
cs.CC2020
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players
Jeffrey Bosboom, Charlotte Chen, Lily Chung +12
We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, prov…