×

Exact Algorithms and APX-Hardness Results for Geometric Packing and Covering Problems - Journal Version.pdf

Home / Discover /csclub.uwaterloo.ca/~egrant/Elyot Research Papers/

  Parent Folder


Exact Algorithms and APX-Hardness Results for Geometric Packing and Covering Problems - Journal Version.pdf
PDF 4 years ago 1.62 kB
Copy Link   
Exact Algorithms and APX-Hardness Results for Geometric Set Cover.pdf
PDF 4 years ago 150.21 kB
Copy Link   
Elyot Grant SM Thesis - Dimension Reduction Algorithms for Near-Optimal Low Distortion Embeddings and Compressive Sensing.pdf
PDF 4 years ago 1.62 kB
Copy Link   
Elyot Grant Masters Thesis - Covering Problems via Structural Approaches.pdf
PDF 4 years ago 2.49 MB
Copy Link   
Nearly Optimal Linear Embeddings Into Very Low Dimensions.pdf
PDF 4 years ago 1.62 kB
Copy Link   
On Column Restricted and Priority Integer Covering Programs.pdf
PDF 4 years ago 1.62 kB
Copy Link   
Compressive Sensing Using Locality-Preserving Matrices.pdf
PDF 4 years ago 198.00 kB
Copy Link   
Closures in Formal Languages and Kuratowski's Theorem.pdf
PDF 4 years ago Get Size
Copy Link   
Self-Approaching Graphs.pdf
PDF 4 years ago 1.62 kB
Copy Link   
Strip Packing with Slicing.pdf
PDF 4 years ago 1.62 kB
Copy Link   
Bounds for the Discrete Correlation of Infinite Sequences.pdf
PDF 4 years ago 1.62 kB
Copy Link   
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems.pdf
PDF 4 years ago 1.62 kB
Copy Link   
A Geometric Approach to Combinatorial Fixed-Point Theorems.pdf
PDF 4 years ago 1.62 kB
Copy Link   
The School Bus Problem on Trees.pdf
PDF 4 years ago 1.62 kB
Copy Link   
Weighted Capacitated, Priority, and Geometric Set Cover via Improved Quasi-Uniform Sampling.pdf
PDF 4 years ago 1.62 kB
Copy Link   

Join FilePursuit on FilePursuit Discord Server chat for discussions and more information.