default search action
Guochuan Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j75]Jinxiang Gan, Guochuan Zhang, Yuhao Zhang:
Bike rebalancing: How to find a balanced matching in the k center problem? Eur. J. Oper. Res. 316(3): 845-855 (2024) - [j74]Hua Chen, Lin Chen, Guochuan Zhang:
FPT algorithms for a special block-structured integer program with applications in scheduling. Math. Program. 208(1): 463-496 (2024) - [j73]Xiaoyu Wu, Lili Mei
, Guochuan Zhang:
Two homogeneous facility location games with a minimum distance requirement on a circle. Theor. Comput. Sci. 991: 114398 (2024) - [c57]Zheng Chen, Bo Li, Minming Li, Guochuan Zhang:
Fair and Efficient Division of a Discrete Cake with Switching Utility Loss. AAMAS 2024: 2641-2649 - [c56]Lin Chen, Jiayi Lian
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. SODA 2024: 4828-4848 - [c55]Lin Chen
A Nearly Quadratic-Time FPTAS for Knapsack. STOC 2024: 283-294 - [c54]Lin Chen
Approximating Partition in Near-Linear Time. STOC 2024: 307-318 - [i17]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Approximating Partition in Near-Linear Time. CoRR abs/2402.11426 (2024) - [i16]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
An Improved Pseudopolynomial Time Algorithm for Subset Sum. CoRR abs/2402.14493 (2024) - 2023
- [j72]Chenyang Xu
Learning-augmented algorithms for online subset sum. J. Glob. Optim. 87(2): 989-1008 (2023) - [j71]Jacek Blazewicz
Mathematical challenges in scheduling theory. J. Sched. 26(6): 519-521 (2023) - [j70]Wei Yu, Mordecai J. Golin
Scheduling on a graph with release times. J. Sched. 26(6): 571-580 (2023) - [c53]Houyu Zhou, Guochuan Zhang, Lili Mei, Minming Li:
Facility Location Games with Thresholds. AAMAS 2023: 2170-2178 - [i15]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results. CoRR abs/2307.12582 (2023) - [i14]Lin Chen, Jiayi Lian, Yuchen Mao, Guochuan Zhang:
A Nearly Quadratic-Time FPTAS for Knapsack. CoRR abs/2308.07821 (2023) - 2022
- [j69]Hua Chen
Block-structured integer programming: Can we parameterize without the largest coefficient? Discret. Optim. 46: 100743 (2022) - [j68]Bo Chen
Preface. J. Comb. Optim. 43(5): 1507-1508 (2022) - [j67]Chenhao Zhang, Guochuan Zhang
From packing rules to cost-sharing mechanisms. J. Comb. Optim. 44(3): 1578-1593 (2022) - [j66]Deshi Ye
Truthful mechanism design for bin packing with applications on cloud computing. J. Comb. Optim. 44(4): 2224-2245 (2022) - [c52]Lin Chen, Xiaoyu Wu, Guochuan Zhang
Approximation Algorithms for Interdiction Problem with Packing Constraints. ICALP 2022: 39:1-39:19 - [e4]Jing Chen, Minming Li, Guochuan Zhang:
Frontiers of Algorithmics - International Joint Conference, IJTCS-FAW 2021, Beijing, China, August 16-19, 2021, Proceedings. Lecture Notes in Computer Science 12874, Springer 2022, ISBN 978-3-030-97098-7 [contents] - [i13]Changjun Wang, Guochuan Zhang:
A Best Cost-Sharing Rule for Selfish Bin Packing. CoRR abs/2204.09202 (2022) - [i12]Lin Chen, Xiaoyu Wu, Guochuan Zhang:
Approximation Algorithms for Interdiction Problem with Packing Constraints. CoRR abs/2204.11106 (2022) - [i11]Zheng Chen, Bo Li, Minming Li, Guochuan Zhang
Fair Graphical Resource Allocation with Matching-Induced Utilities. CoRR abs/2212.01031 (2022) - 2021
- [j65]Deshi Ye
On the price of anarchy of two-stage machine scheduling games. J. Comb. Optim. 42(3): 616-635 (2021) - [j64]Jacek Blazewicz
New Perspectives in Scheduling Theory. J. Sched. 24(5): 455-457 (2021) - [j63]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Approximate ridesharing of personal vehicles problem. Theor. Comput. Sci. 871: 30-50 (2021) - [j62]Hua Chen, Lin Chen, Guochuan Zhang
Scheduling with variable-length calibrations: Two agreeable variants. Theor. Comput. Sci. 886: 94-105 (2021) - [c51]Liucheng Sun, Chenwei Weng, Chengfu Huo, Weijun Ren, Guochuan Zhang, Xin Li:
Traffic Shaping in E-Commercial Search Engine: Multi-Objective Online Welfare Maximization. AAAI 2021: 574-581 - [c50]Liangde Tao, Lin Chen, Guochuan Zhang:
Scheduling Stochastic Jobs - Complexity and Approximation Algorithms. ICAPS 2021: 367-375 - [c49]Xiaoyu Wu, Lili Mei, Guochuan Zhang
Two-Facility Location Games with a Minimum Distance Requirement on a Circle. COCOA 2021: 497-511 - 2020
- [c48]Hua Chen, Vincent Chau, Lin Chen
Scheduling Many Types of Calibrations. AAIM 2020: 286-297 - [c47]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Approximate Ridesharing of Personal Vehicles Problem. COCOA 2020: 3-18 - [i10]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang:
Approximate Ridesharing of Personal Vehicles Problem. CoRR abs/2007.15154 (2020)
2010 – 2019
- 2019
- [j61]Lili Mei, Minming Li
Facility location games with distinct desires. Discret. Appl. Math. 264: 148-160 (2019) - [j60]Yukun Cheng, Qiaoming Han
Strategy-proof mechanisms for obnoxious facility game with bounded service range. J. Comb. Optim. 37(2): 737-755 (2019) - [j59]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Efficient algorithms for ridesharing of personal vehicles. Theor. Comput. Sci. 788: 79-94 (2019) - [c46]Minming Li, Lili Mei, Yi Xu, Guochuan Zhang, Yingchao Zhao:
Facility Location Games with Externalities. AAMAS 2019: 1443-1451 - [c45]Jinxiang Gan, Guochuan Zhang
The k-Delivery Traveling Salesman Problem: Revisited. COCOA 2019: 197-209 - [c44]Deshi Ye, Feng Xie, Guochuan Zhang
Truthful Mechanism Design of Reversed Auction on Cloud Computing. COCOON 2019: 627-638 - [c43]Vincent Chau, Shengzhong Feng, Minming Li
Weighted Throughput Maximization with Calibrations. WADS 2019: 311-324 - [e3]Pinyan Lu, Guochuan Zhang:
30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China. LIPIcs 149, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-130-6 [contents] - [i9]Chenyang Xu, Liangde Tao, Huajingling Wu, Deshi Ye, Guochuan Zhang:
Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks. CoRR abs/1902.10312 (2019) - 2018
- [j58]Lin Chen
Parallel machine scheduling with speed-up resources. Eur. J. Oper. Res. 268(1): 101-112 (2018) - [j57]Ling Gai, Guochuan Zhang
Online lazy bureaucrat scheduling with a machine deadline. J. Comb. Optim. 35(2): 530-537 (2018) - [j56]Lin Chen
On the optimality of exact and approximation algorithms for scheduling problems. J. Comput. Syst. Sci. 96: 1-32 (2018) - [j55]Jacek Blazewicz
New challenges in scheduling theory. J. Sched. 21(6): 581-582 (2018) - [j54]Deshi Ye, Danny Z. Chen, Guochuan Zhang
Online scheduling of moldable parallel tasks. J. Sched. 21(6): 647-654 (2018) - [j53]Lin Chen
Packing Groups of Items into Multiple Knapsacks. ACM Trans. Algorithms 14(4): 51:1-51:24 (2018) - [j52]Lili Mei, Deshi Ye, Guochuan Zhang
Mechanism design for one-facility location game with obnoxious effects on a line. Theor. Comput. Sci. 734: 46-57 (2018) - [j51]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Algorithmic analysis for ridesharing of personal vehicles. Theor. Comput. Sci. 749: 36-46 (2018) - [c42]Chenyang Xu, Guochuan Zhang
The Path Set Packing Problem. COCOON 2018: 305-315 - 2017
- [c41]Deshi Ye, Lin Chen
The Price of Anarchy in Two-Stage Scheduling Games. COCOA (2) 2017: 214-225 - [c40]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Efficient Algorithms for Ridesharing of Personal Vehicles. COCOA (1) 2017: 340-354 - [c39]Chenhao Zhang, Guochuan Zhang
Cost-Sharing Mechanisms for Selfish Bin Packing. COCOA (1) 2017: 355-368 - [c38]Lin Chen
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix. STACS 2017: 22:1-22:14 - 2016
- [j50]Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
Approximate strip packing: Revisited. Inf. Comput. 249: 110-120 (2016) - [j49]Jacek Blazewicz
New challenges in scheduling theory. J. Sched. 19(6): 617-618 (2016) - [j48]Deshi Ye, Guochuan Zhang
Approximate composable truthful mechanism design. Theor. Comput. Sci. 654: 188-198 (2016) - [c37]Lin Chen
Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources. APPROX-RANDOM 2016: 5:1-5:12 - [c36]Lili Mei, Minming Li, Deshi Ye, Guochuan Zhang:
Strategy-proof Mechanism Design for Facility Location Games: Revisited (Extended Abstract). AAMAS 2016: 1463-1464 - [c35]Qian-Ping Gu, Jiajian Leo Liang, Guochuan Zhang
Algorithmic Analysis for Ridesharing of Personal Vehicles. COCOA 2016: 438-452 - [c34]Lin Chen
An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints. COCOA 2016: 608-623 - [c33]Lili Mei, Deshi Ye, Guochuan Zhang
Mechanism Design for One-Facility Location Game with Obnoxious Effects. FAW 2016: 172-182 - [c32]Lin Chen
Packing Groups of Items into Multiple Knapsacks. STACS 2016: 28:1-28:13 - 2015
- [j47]Lin Chen
Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming. Asia Pac. J. Oper. Res. 32(1): 1540011:1-1540011:19 (2015) - [j46]Jacek Blazewicz
New challenges in scheduling theory. RAIRO Oper. Res. 49(2): 335-337 (2015) - [j45]Jacek Blazewicz
New perspectives in scheduling theory. J. Sched. 18(4): 333-334 (2015) - [j44]Lin Chen
An asymptotic competitive scheme for online bin packing. Theor. Comput. Sci. 607: 446-454 (2015) - [c31]Deshi Ye, Guochuan Zhang
Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem. COCOON 2015: 390-401 - 2014
- [j43]Lin Chen
Online Scheduling of mixed CPU-GPU jobs. Int. J. Found. Comput. Sci. 25(6): 745-762 (2014) - [j42]Yunqiang Yin, Deshi Ye, Guochuan Zhang
Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval. Inf. Sci. 274: 310-322 (2014) - [j41]Lin Chen
An improved lower bound for rank four scheduling. Oper. Res. Lett. 42(5): 348-350 (2014) - [j40]Ding-Zhu Du, Guochuan Zhang:
Computing and Combinatorics. Theor. Comput. Sci. 554: 1 (2014) - [c30]Lin Chen
An Asymptotic Competitive Scheme for Online Bin Packing. COCOA 2014: 13-24 - [c29]Lin Chen, Klaus Jansen, Guochuan Zhang
On the optimality of approximation schemes for the classical scheduling problem. SODA 2014: 657-668 - 2013
- [j39]Michael A. Bender, Jacek Blazewicz
Guest editorial: "New trends in scheduling" - Centre CNRS "La Villa Clythia" Frejus Workshop, September 12-17, 2010. J. Sched. 16(4): 347-348 (2013) - [j38]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang
A Harmonic Algorithm for the 3D Strip Packing Problem. SIAM J. Comput. 42(2): 579-592 (2013) - [j37]Lin Chen
Approximation algorithms for a bi-level knapsack problem. Theor. Comput. Sci. 497: 1-12 (2013) - [j36]Yukun Cheng, Wei Yu, Guochuan Zhang
Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theor. Comput. Sci. 497: 154-163 (2013) - [c28]Lin Chen
Online Scheduling on a CPU-GPU Cluster. TAMC 2013: 1-9 - [c27]Yukun Cheng, Qiaoming Han, Wei Yu, Guochuan Zhang
Obnoxious Facility Game with a Bounded Service Range. TAMC 2013: 272-281 - [e2]Ding-Zhu Du, Guochuan Zhang:
Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings. Lecture Notes in Computer Science 7936, Springer 2013, ISBN 978-3-642-38767-8 [contents] - [i8]Lin Chen, Deshi Ye, Guochuan Zhang:
Approximating the optimal competitive ratio for an ancient online scheduling problem. CoRR abs/1302.3946 (2013) - [i7]Lin Chen, Deshi Ye, Guochuan Zhang:
A note on scheduling with low rank processing times. CoRR abs/1306.3727 (2013) - [i6]Lin Chen, Klaus Jansen, Guochuan Zhang:
On the optimality of approximation schemes for the classical scheduling problem. CoRR abs/1310.0398 (2013) - 2012
- [j35]Wenchang Luo
Approximation schemes for two-machine flow shop scheduling with two agents. J. Comb. Optim. 24(3): 229-239 (2012) - [c26]Wei Yu, Mordecai J. Golin
Vehicle Scheduling on a Graph Revisited. ISAAC 2012: 362-371 - [c25]Deshi Ye, Guochuan Zhang
Coordination Mechanisms for Selfish Parallel Jobs Scheduling - (Extended Abstract). TAMC 2012: 225-236 - 2011
- [j34]Haifeng Xu, Lin Chen
Scheduling on two identical machines with a speed-up resource. Inf. Process. Lett. 111(17): 831-835 (2011) - [j33]Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang
A new upper bound 2.5545 on 2D Online Bin Packing. ACM Trans. Algorithms 7(4): 50:1-50:18 (2011) - [j32]Deshi Ye, Xin Han, Guochuan Zhang
Online multiple-strip packing. Theor. Comput. Sci. 412(3): 233-239 (2011) - [c24]Lin Chen
Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget. FAW-AAIM 2011: 244-254 - [c23]Yukun Cheng, Wei Yu, Guochuan Zhang
Mechanisms for Obnoxious Facility Game on a Path. COCOA 2011: 262-271 - [c22]Lin Chen
Approximation Algorithms for a Bi-level Knapsack Problem. COCOA 2011: 399-410 - [c21]Veronika Rehn-Sonigo, Denis Trystram, Frédéric Wagner, Haifeng Xu, Guochuan Zhang
Offline Scheduling of Multi-threaded Request Streams on a Caching Server. IPDPS 2011: 1167-1176 - [c20]Wei Yu, Guochuan Zhang
Improved Approximation Algorithms for Routing Shop Scheduling. ISAAC 2011: 30-39 - 2010
- [j31]Kazuo Iwama, Guochuan Zhang
Online knapsack with resource augmentation. Inf. Process. Lett. 110(22): 1016-1020 (2010) - [j30]Deshi Ye, Guochuan Zhang
On-line scheduling of multi-core processor tasks with virtualization. Oper. Res. Lett. 38(4): 307-311 (2010) - [j29]Michael A. Bender, Jacek Blazewicz
Guest editorial - Special issue "New challenges in scheduling theory" (Marseilles Workshop, May 12-16, 2008). J. Sched. 13(5): 451-452 (2010) - [j28]Deshi Ye, Xin Han, Guochuan Zhang
Deterministic on-line call control in cellular networks. Theor. Comput. Sci. 411(31-33): 2871-2877 (2010) - [c19]Wenchang Luo
Approximation Algorithms for Scheduling with a Variable Machine Maintenance. AAIM 2010: 209-219
2000 – 2009
- 2009
- [j27]Deshi Ye, Guochuan Zhang
On-line extensible bin packing with unequal bin sizes. Discret. Math. Theor. Comput. Sci. 11(1): 141-152 (2009) - [j26]Jacob Jan Paulus, Deshi Ye, Guochuan Zhang
Optimal online-list batch scheduling. Inf. Process. Lett. 109(19): 1125-1128 (2009) - [j25]Deshi Ye, Xin Han, Guochuan Zhang
A note on online strip packing. J. Comb. Optim. 17(4): 417-423 (2009) - [j24]Ling Gai, Guochuan Zhang
Hardness of lazy packing and covering. Oper. Res. Lett. 37(2): 89-92 (2009) - [j23]Guosong Yu, Guochuan Zhang
Scheduling with a minimum number of machines. Oper. Res. Lett. 37(2): 97-101 (2009) - [c18]Deshi Ye, Xin Han, Guochuan Zhang
On-Line Multiple-Strip Packing. COCOA 2009: 155-165 - [c17]Jihuan Ding, Guochuan Zhang
A Note on Online Scheduling for Jobs with Arbitrary Release Times. COCOA 2009: 354-362 - [i5]Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang:
A New Upper Bound on 2D Online Bin Packing. CoRR abs/0906.0409 (2009) - 2008
- [j22]Ling Gai, Guochuan Zhang
On lazy bureaucrat scheduling with common deadlines. J. Comb. Optim. 15(2): 191-199 (2008) - [j21]Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang
On-line scheduling of parallel jobs on two machines. J. Discrete Algorithms 6(1): 3-10 (2008) - [j20]Xin Han, Kazuo Iwama, Guochuan Zhang
Online Removable Square Packing. Theory Comput. Syst. 43(1): 38-55 (2008) - [c16]Guosong Yu, Guochuan Zhang
Bin Packing of Selfish Items. WINE 2008: 446-453 - [i4]Xin Han, Kazuo Iwama, Guochuan Zhang:
On Two Dimensional Orthogonal Knapsack Problem. CoRR abs/0803.4260 (2008) - 2007
- [j19]Klaus Jansen, Guochuan Zhang
Maximizing the Total Profit of Rectangles Packed into a Rectangle. Algorithmica 47(3): 323-342 (2007) - [j18]Deshi Ye, Guochuan Zhang
Maximizing the throughput of parallel jobs on hypercubes. Inf. Process. Lett. 102(6): 259-263 (2007) - [j17]Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang
Online bin packing of fragile objects with application in cellular networks. J. Comb. Optim. 14(4): 427-435 (2007) - [j16]Deshi Ye, Guochuan Zhang
On-line scheduling of parallel jobs in a list. J. Sched. 10(6): 407-413 (2007) - [j15]Deshi Ye, Guochuan Zhang
On-line scheduling mesh jobs with dependencies. Theor. Comput. Sci. 372(1): 94-102 (2007) - [c15]Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
Strip Packing vs. Bin Packing. AAIM 2007: 358-367 - [c14]Kazuo Iwama, Guochuan Zhang:
Optimal Resource Augmentations for Online Knapsack. APPROX-RANDOM 2007: 180-188 - [c13]Jihuan Ding, Tomás Ebenlendr, Jirí Sgall
Online Scheduling of Equal-Length Jobs on Parallel Machines. ESA 2007: 427-438 - [c12]Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
Harmonic algorithm for 3-dimensional strip packing problem. SODA 2007: 1197-1206 - [c11]Haiyang Hou, Guochuan Zhang:
The Hardness of Selective Network Design for Bottleneck Routing Games. TAMC 2007: 58-66 - [e1]Bo Chen
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers. Lecture Notes in Computer Science 4614, Springer 2007, ISBN 978-3-540-74449-8 [contents] - 2006
- [c10]Jihuan Ding, Guochuan Zhang
Online Scheduling with Hard Deadlines on Parallel Machines. AAIM 2006: 32-42 - [c9]Ling Gai, Guochuan Zhang
Common Deadline Lazy Bureaucrat Scheduling Revisited. LATIN 2006: 515-523 - [i3]Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang:
Strip Packing vs. Bin Packing. CoRR abs/cs/0607046 (2006) - [i2]Xin Han, Kazuo Iwama, Guochuan Zhang:
New Upper Bounds on The Approximability of 3D Strip Packing. CoRR abs/cs/0607100 (2006) - [i1]Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang:
Strip Packing vs. Bin Packing. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j14]Guochuan Zhang
A 3-approximation algorithm for two-dimensional bin packing. Oper. Res. Lett. 33(2): 121-126 (2005) - [c8]Xin Han, Kazuo Iwama, Guochuan Zhang
Online Removable Square Packing. WAOA 2005: 216-229 - [c7]Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochuan Zhang
Online Bin Packing of Fragile Objects with Application in Cellular Networks. WINE 2005: 564-573 - 2004
- [c6]Deshi Ye, Guochuan Zhang
On-Line Scheduling of Parallel Jobs. SIROCCO 2004: 279-290 - [c5]Klaus Jansen, Guochuan Zhang:
On rectangle packing: maximizing benefits. SODA 2004: 204-213 - [c4]Klaus Jansen, Guochuan Zhang
Maximizing the Number of Packed Rectangles. SWAT 2004: 362-371 - 2003
- [j13]Deshi Ye, Guochuan Zhang
On-line scheduling with extendable working time on a small number of machines. Inf. Process. Lett. 85(4): 171-177 (2003) - [j12]Aleksei V. Fishkin, Guochuan Zhang
On maximizing the throughput of multiprocessor tasks. Theor. Comput. Sci. 302(1-3): 319-335 (2003) - [c3]Deshi Ye, Guochuan Zhang
Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes. ISAAC 2003: 329-338 - [c2]Deshi Ye, Guochuan Zhang
On-Line Extensible Bin Packing with Unequal Bin Sizes. WAOA 2003: 235-247 - 2002
- [c1]Aleksei V. Fishkin, Guochuan Zhang
On Maximizing the Throughput of Multiprocessor Tasks. MFCS 2002: 269-279 - 2001
- [j11]Guochuan Zhang
An on-line bin-batching problem. Discret. Appl. Math. 108(3): 329-333 (2001) - 2000
- [j10]Guangting Chen, Guochuan Zhang
A constrained minimum spanning tree problem. Comput. Oper. Res. 27(9): 867-875 (2000) - [j9]Guochuan Zhang
Linear time-approximation algorithms for bin packing. Oper. Res. Lett. 26(5): 217-222 (2000)
1990 – 1999
- 1999
- [j8]Yong He, Guochuan Zhang
Semi On-Line Scheduling on Two Identical Machines. Computing 62(3): 179-187 (1999) - [j7]Gerhard J. Woeginger, Guochuan Zhang
Optimal on-line algorithms for variable-sized bin covering. Oper. Res. Lett. 25(1): 47-50 (1999) - 1998
- [j6]Guochuan Zhang
Parameterized On-Line Open-End Bin Packing. Computing 60(3): 267-274 (1998) - [j5]Jiye Han, Jianjun Wen, Guochuan Zhang
A new approximation algorithm for UET-Scheduling with chain-type precedence constraints. Comput. Oper. Res. 25(9): 767-771 (1998) - 1997
- [j4]Rainer E. Burkard, Guochuan Zhang:
Bounded Space On-Line Variable-Sized Bin Packing. Acta Cybern. 13(1): 63-76 (1997) - [j3]Guochuan Zhang
A New Version of On-line Variable-sized Bin Packing. Discret. Appl. Math. 72(3): 193-197 (1997) - [j2]Guochuan Zhang
A Simple Semi On-Line Algorithm for P2//C_{max} with a Buffer. Inf. Process. Lett. 61(3): 145-148 (1997) - 1996
- [j1]Guochuan Zhang
Short Communication: Worst-Case Analysis of the FFH Algorithm for Online Variable-Sized Bin Packing. Computing 56(2): 165-172 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: