Pages that link to "Item:Q5900920"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900920):
Displaying 19 items.
- Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
- Strong-diameter decompositions of minor free graphs (Q613118) (← links)
- Metric uniformization and spectral bounds for graphs (Q659931) (← links)
- On average distortion of embedding metrics into the line (Q938313) (← links)
- Randomly removing \(g\) handles at once (Q991176) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- Extending Lipschitz functions via random metric partitions (Q1770278) (← links)
- Conformal growth rates and spectral geometry on distributional limits of graphs (Q2072081) (← links)
- Metric extension operators, vertex sparsifiers and Lipschitz extendability (Q2630142) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs (Q5232322) (← links)
- Comparison of Metric Spectral Gaps (Q5402099) (← links)
- Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
- (Q5875457) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- The intrinsic dimensionality of graphs (Q5900392) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)
