Yong Zhang

From MaRDI portal
Revision as of 01:59, 25 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:243623

Available identifiers

zbMath Open zhang.yong.8MaRDI QIDQ243623

List of research outcomes





PublicationDate of PublicationType
EFX allocation to chores over small graph2024-09-16Paper
\(k\)-median/means with outliers revisited: a simple fpt approximation2024-08-22Paper
Planar matrices and arrays of Feynman diagrams2024-07-25Paper
MPCNet: smart contract-based multiparty computing network for federated learning2024-05-23Paper
An improved approximation algorithm for a scheduling problem with transporter coordination2024-04-02Paper
The existence and efficiency of PMMS allocations2024-02-20Paper
A semi brute-force search approach for (balanced) clustering2024-01-09Paper
Approximation and competitive algorithms for single-minded selling problem2023-10-16Paper
Exact and approximation algorithms for PMMS under identical constraints2023-08-04Paper
Approximation algorithms for diversity-bounded center problems2023-08-04Paper
EFX under budget constraint2023-08-03Paper
A linear-time certifying algorithm for recognizing generalized series-parallel graphs2022-12-08Paper
Online data caching in edge-cloud collaborative system with the data center2022-10-31Paper
Principal-agent problem under the linear contract2022-10-18Paper
On stochastic \(k\)-facility location2022-07-01Paper
An online algorithm for data caching problem in edge computing2022-07-01Paper
Constant competitive algorithms for unbounded one-way trading under monotone hazard rate2022-03-07Paper
Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties2021-09-10Paper
Influence maximization under the non-progressive linear threshold model2021-07-08Paper
Minimizing energy on homogeneous processors with shared memory2021-07-08Paper
Robustness and approximation for the linear contract design2021-07-05Paper
Search complexity: a way for the quantitative analysis of the search space2021-07-05Paper
Minimizing energy on homogeneous processors with shared memory2021-04-14Paper
A constant FPT approximation algorithm for hard-capacitated \(k\)-means2021-01-18Paper
\(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space2020-09-01Paper
Approximation algorithms for the partial assignment problem2020-09-01Paper
Approximation algorithms for the selling with preference2020-07-29Paper
Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint2020-06-24Paper
Algorithmic pricing for the partial assignment2020-05-13Paper
Approximation algorithm and incentive ratio of the selling with preference2020-05-13Paper
Offline and online algorithms for single-minded selling problem2020-04-22Paper
Universal facility location in generalized metric space2020-02-24Paper
Weighted throughput maximization with calibrations2020-01-16Paper
Online uniformly inserting points on the sphere2020-01-13Paper
Realtime Channel Recommendation: Switch Smartly While Watching TV2019-04-26Paper
Approximation strategy-proof mechanisms for obnoxious facility location on a line2018-07-20Paper
Unbounded one-way trading on distributions with monotone hazard rate2018-02-26Paper
Online Inserting Points Uniformly on the Sphere2017-05-05Paper
Constrained pairwise and center-star sequences alignment problems2016-10-20Paper
Competitive algorithms for unbounded one-way trading2015-12-08Paper
Strategy-Proof Mechanism for Obnoxious Facility Location on a Line2015-10-29Paper
Competitive Algorithms for Unbounded One-Way Trading2015-05-20Paper
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing2014-10-06Paper
Online pricing for bundles of multiple items2014-09-18Paper
A new upper bound 2.5545 on 2D Online Bin Packing2014-09-09Paper
On the Complexity of Constrained Sequences Alignment Problems2014-09-02Paper
Constant-competitive tree node assignment2014-01-13Paper
Deterministic polynomial-time algorithms for designing short DNA words2014-01-10Paper
A note on a selfish bin packing problem2013-08-07Paper
Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing2013-08-02Paper
Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing2013-06-11Paper
Uniformly inserting points on square grid2013-04-04Paper
COMPETITIVE ALGORITHMS FOR ONLINE PRICING2012-10-15Paper
Online Pricing for Multi-type of Items2012-07-16Paper
Online call control in cellular networks revisited2012-03-09Paper
Online tree node assignment with resource augmentation2011-12-15Paper
Competitive Algorithms for Online Pricing2011-08-17Paper
Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing2011-06-03Paper
ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING2011-01-19Paper
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing2010-12-09Paper
Absolute and asymptotic bounds for online frequency allocation in cellular networks2010-09-16Paper
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks2010-09-07Paper
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs2010-07-20Paper
Online Uniformly Inserting Points on Grid2010-07-20Paper
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words2010-06-17Paper
A note on on-line broadcast scheduling with deadlines2010-06-16Paper
A constant-competitive algorithm for online OVSF code assignment2010-02-23Paper
Greedy online frequency allocation in cellular networks2010-01-29Paper
1-Bounded Space Algorithms for 2-Dimensional Bin Packing2009-12-17Paper
A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs2009-11-25Paper
Online Tree Node Assignment with Resource Augmentation2009-07-23Paper
Variable-Size Rectangle Covering2009-07-07Paper
A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs2009-03-06Paper
On-line scheduling of parallel jobs on two machines2008-11-18Paper
A Constant-Competitive Algorithm for Online OVSF Code Assignment2008-05-27Paper
Frequency Allocation Problems for Linear Cellular Networks2008-04-24Paper
Online bin packing of fragile objects with application in cellular networks2008-04-23Paper
Online OVSF Code Assignment with Resource Augmentation2008-01-04Paper
Efficient algorithms for finding a longest common increasing subsequence2007-07-19Paper
Approximating the minimum weight weak vertex cover2007-01-09Paper
Algorithms and Computation2006-11-14Paper
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time2006-08-14Paper
Computing and Combinatorics2006-01-11Paper
Computing and Combinatorics2005-06-15Paper

Research outcomes over time

This page was built for person: Yong Zhang