Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Constraint solving via fractional edge covers: Label: en
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity: Label: en
Many distances in planar graphs: Label: en
Correlation clustering with a fixed number of clusters: Label: en
The space complexity of pass-efficient algorithms for clustering: Label: en
A general approach for incremental approximation and hierarchical clustering: Label: en
Sampling algorithms for l₂ regression and applications: Label: en
Relating singular values and discrepancy of weighted directed graphs: Label: en
Single-minded unlimited supply pricing on sparse instances: Label: en
Knapsack auctions: Label: en
Revenue maximization when bidders have budgets: Label: en
Single-value combinatorial auctions and implementation in undominated strategies: Label: en
Improved lower bounds for embeddings into L₁: Label: en
Analyzing BitTorrent and related peer-to-peer networks: Label: en
On the competitive ratio of evaluating priced functions: Label: en
On the chromatic number of some geometric hypergraphs: Label: en
On the capacity of information networks: Label: en
Computing steiner minimum trees in Hamming metric: Label: en
Facility location with hierarchical facility costs: Label: en
A near-tight approximation lower bound and algorithm for the kidnapped robot problem: Label: en
Finding nucleolus of flow game: Label: en
Computing sequential equilibria for two-player games: Label: en
Small hop-diameter sparse spanners for doubling metrics: Label: en
Improved embeddings of graph metrics into random trees: Label: en
Directed metrics and directed graph partitioning problems: Label: en
Local versus global properties of metric spaces: Label: en
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph: Label: en
Design of data structures for mergeable trees: Label: en
Squeezing succinct data structures into entropy bounds: Label: en
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries: Label: en
The hunting of the bump: Label: en
The complexity of matrix completion: Label: en
A tight upper bound on the probabilistic embedding of series-parallel graphs: Label: en
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing: Label: en
Deterministic boundary recognition and topology extraction for large sensor networks: Label: en
The price of being near-sighted: Label: en
Oblivious network design: Label: en
Robbing the bandit: Label: en
New lower bounds for oblivious routing in undirected graphs: Label: en
Query-efficient algorithms for polynomial interpolation over composites: Label: en
Max-tolerance graphs as intersection graphs: Label: en
DAG-width: Label: en
Certifying large branch-width: Label: en
Spanners and emulators with sublinear distance errors: Label: en
Generating all vertices of a polyhedron is hard: Label: en
Maintaining significant stream statistics over sliding windows: Label: en
The complexity of quantitative concurrent parity games: Label: en
Improved lower and upper bounds for universal TSP in planar metrics: Label: en
Cache-oblivious string dictionaries: Label: en
Four point conditions and exponential neighborhoods for symmetric TSP: Label: en