scientific article; zbMATH DE number 7359375
From MaRDI portal
Publication:4993304
DOI10.4230/LIPIcs.ITCS.2018.38zbMath1462.68132arXiv1711.07567MaRDI QIDQ4993304
Ramamoorthy Sivaramakrishnan Natarajan, Cyrus Rashtchian, Makrand Sinha, Sariel Har-Peled, P. W. Beame
Publication date: 15 June 2021
Full work available at URL: https://arxiv.org/abs/1711.07567
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (4)
On triangle estimation using tripartite independent set queries ⋮ Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle ⋮ Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems ⋮ Unnamed Item
Cites Work
- Comparing the strength of query types in property testing: the case of \(k\)-colorability
- Shortest paths in intersection graphs of unit disks
- Counting Stars and Other Small Subgraphs in Sublinear-Time
- Approximating average parameters of graphs
- On Approximating the Depth and Related Problems
- On Approximation Algorithms for # P
- Approximately Counting Triangles in Sublinear Time
- On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
- Approximation and Online Algorithms
- Concentration of Measure for the Analysis of Randomized Algorithms
This page was built for publication:
