论文信息 - Approximation Algorithms for Fractional Covering and Packing Problems, and Applications

Approximation Algorithms for Fractional Covering and Packing Problems, and Applications

In this talk we present fast algorithms that find approximate solutions for a general class of problems, which are called fractional packing and covering problems. We describe two main lines of research: algorithms by Plotkin, Shmoys and Tardos [7], algorithms by Grigoriadis, Khachiyan, Porkolab and Villavicencio [1,2]. and new developments.

Klaus Jansen | K. Jansen

[1] Leonid Khachiyan,et al. Approximate Max-Min Resource Sharing for Structured Concave Optimization , 2000, SIAM J. Optim..

[2] Claire Mathieu,et al. Approximate strip packing , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[3] Klaus Jansen,et al. Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks , 1999, SODA '99.

[4] Éva Tardos,et al. Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[5] Leonid Khachiyan,et al. Coordination Complexity of Parallel Price-Directive Decomposition , 1996, Math. Oper. Res..

[6] Klaus Jansen,et al. Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs , 2001, SIAM J. Comput..

[7] Klaus Jansen,et al. Improved approximation schemes for scheduling unrelated parallel machines , 1999, STOC '99.

[8] Klaus Jansen,et al. On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes , 2002, IPCO.