Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
Proceedings of the 48th Annual
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
Uniform-Ironed-Virtual-Value Item Pricing achieves a tight 3-approximation to the Duality Relaxation Benchmark in unit-demand single-buyer revenue maximization.
Online min-cost matching with general arrivals has unbounded competitive ratio in adversarial and random-order models but admits an O(log² n)-competitive algorithm in the unknown i.i.d. model.
Polynomial samples learn dual pricing and polynomial queries learn near-optimal anonymous pricing for online resource allocation with heterogeneous agents.
citing papers explorer
-
Directed Low Diameter Decomposition for Structured Digraphs
Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
-
Benchmark-Tight Approximation Ratio of Simple Mechanism for a Unit-Demand Buyer
Uniform-Ironed-Virtual-Value Item Pricing achieves a tight 3-approximation to the Duality Relaxation Benchmark in unit-demand single-buyer revenue maximization.
-
Online Min-Cost Matching with General Arrivals
Online min-cost matching with general arrivals has unbounded competitive ratio in adversarial and random-order models but admits an O(log² n)-competitive algorithm in the unknown i.i.d. model.
-
Learning Anonymous Pricing for Online Resource Allocation
Polynomial samples learn dual pricing and polynomial queries learn near-optimal anonymous pricing for online resource allocation with heterogeneous agents.