The following pages link to Yicheng Xu (Q506470):
Displaying 25 items.
- Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
- Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain (Q1753138) (← links)
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
- On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint (Q2149857) (← links)
- On stochastic \(k\)-facility location (Q2151361) (← links)
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space (Q2197535) (← links)
- Approximation algorithms for the partial assignment problem (Q2197546) (← links)
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
- Universal facility location in generalized metric space (Q2300073) (← links)
- Maximization of constrained non-submodular functions (Q2300075) (← links)
- An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
- Approximation algorithm for squared metric facility location problem with nonuniform capacities (Q2422751) (← links)
- Improved approximation algorithm for universal facility location problem with linear penalties (Q2424885) (← links)
- On streaming algorithms for maximizing a supermodular function plus a MDR-submodular function on the integer lattice (Q2682805) (← links)
- Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
- (Q3132643) (← links)
- A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties (Q3467835) (← links)
- (Q5382416) (← links)
- Thresholding Methods for Streaming Submodular Maximization with a Cardinality Constraint and Its Variants (Q5864849) (← links)
- Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques (Q6053502) (← links)
- Approximation algorithms for the individually fair \(k\)-center with outliers (Q6064038) (← links)
- A semi brute-force search approach for (balanced) clustering (Q6185939) (← links)
- The existence and efficiency of PMMS allocations (Q6201323) (← links)
- \(k\)-median/means with outliers revisited: a simple fpt approximation (Q6591646) (← links)
- EFX allocation to chores over small graph (Q6606239) (← links)
