Cut sparsification and succinct representation of submodular hypergraphs
From MaRDI portal
Cites work
- A general framework for graph sparsification
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- Code sparsification and its applications
- Graph sparsification by effective resistances
- scientific article; zbMATH DE number 5888315 (Why is no real title available?)
- scientific article; zbMATH DE number 1256718 (Why is no real title available?)
- scientific article; zbMATH DE number 7051222 (Why is no real title available?)
- Hypergraph Cuts with General Splitting Functions
- Linear-sized sparsifiers via near-linear time discrepancy theory
- Near-linear size hypergraph cut sparsifiers
- Nearly tight spectral sparsification of directed hypergraphs
- New notions and constructions of sparsification for graphs and hypergraphs
- On fully dynamic graph sparsifiers
- On maximizing welfare when utility functions are subadditive
- On sketching quadratic forms
- Optimal bounds on approximation of submodular and XOS functions by juntas
- Optimal lower bounds for sketching graph cuts
- Privately releasing conjunctions and the statistical query barrier
- Quotient sparsification for submodular functions
- Sketching cuts in graphs and hypergraphs
- Sparse sums of positive semidefinite matrices
- Sparsifying sums of norms
- Spectral sparsification of graphs
- Spectral sparsification of hypergraphs
- Submodular function minimization
- Submodular functions are noise stable
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- Towards \((1 + \varepsilon)\)-approximate flow sparsifiers
- Towards tight bounds for spectral sparsification of hypergraphs
- Twice-Ramanujan sparsifiers
This page was built for publication: Cut sparsification and succinct representation of submodular hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875096)
