The following pages link to Chen-Chen Wu (Q1690579):
Displaying 50 items.
- (Q278735) (redirect page) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
- Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
- Approximation algorithms for the robust/soft-capacitated 2-level facility location problems (Q683730) (← links)
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
- An approximation algorithm for the stochastic fault-tolerant facility location problem (Q743782) (← links)
- Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
- Approximation and hardness results for the max \(k\)-uncut problem (Q1630990) (← links)
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
- An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities (Q1690580) (← links)
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← links)
- An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem (Q1706681) (← links)
- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming (Q1749453) (← links)
- (Q2018917) (redirect page) (← links)
- An improved per-scenario bound for the two-stage stochastic facility location problem (Q2018918) (← links)
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations (Q2019514) (← links)
- An LP-rounding based algorithm for a uniform capacitated facility location problem with penalties (Q2037976) (← links)
- 2-level station location for bike sharing (Q2039650) (← links)
- Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
- Local search algorithm for the spherical \(k\)-means problem with outliers (Q2039653) (← links)
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
- Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266) (← links)
- An approximation algorithm for the \(k\)-level facility location problem with outliers (Q2047198) (← links)
- An approximation algorithm for stochastic multi-level facility location problem with soft capacities (Q2082185) (← links)
- An approximation algorithm for the spherical \(k\)-means problem with outliers by local search (Q2084618) (← links)
- Approximation algorithm for spherical \(k\)-means problem with penalty (Q2086912) (← links)
- Selfish bin packing under harmonic mean cost sharing mechanism (Q2136882) (← links)
- On stochastic \(k\)-facility location (Q2151361) (← links)
- Approximation algorithms for the dynamic \(k\)-level facility location problems (Q2220850) (← links)
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460) (← links)
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
- An improved approximation algorithm for the \(2\)-catalog segmentation problem using semidefinite programming relaxation (Q2358849) (← links)
- An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
- A local search approximation algorithm for the \(k\)-means problem with penalties (Q2412437) (← links)
- Local search approximation algorithms for the \(k\)-means problem with penalties (Q2420650) (← links)
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
- Approximation algorithms for the fault-tolerant facility location problem with penalties (Q2422738) (← links)
- Approximation algorithm for squared metric two-stage stochastic facility location problem (Q2424830) (← links)
- Improved approximation algorithm for universal facility location problem with linear penalties (Q2424885) (← links)
- Approximate the lower-bounded connected facility location problem (Q2695316) (← links)
- Approximation algorithms for the stochastic priority facility location problem (Q2868906) (← links)
- A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem (Q2920470) (← links)
- Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties (Q2920471) (← links)
- An Approximation Algorithm for the Two-Stage Distributionally Robust Facility Location Problem (Q2942463) (← links)
- Approximation Algorithms for the Robust Facility Location Problem with Penalties (Q2942466) (← links)
- Approximation and Hardness Results for the Max k-Uncut Problem (Q2958303) (← links)
