10 citations · 20 across the 13 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CC2018★ 1 cited
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster +5
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a sce…
cs.CR2018★ 2 cited
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling
Thaddeus Dryja, Quanquan C. Liu, Sunoo Park
Pebble games were originally formulated to study time-space tradeoffs in computation, modeled by games played on directed acyclic graphs (DAGs). Close connections between pebbling…