Improved approximation guarantees for packing and covering integer programs
SIAM Journal on Computing
Saved in:
Main Author: | Srinivasan, A. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39172 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
Graph learning assisted multi-objective integer programming
by: WU, Yaoxin, et al.
Published: (2021)
by: WU, Yaoxin, et al.
Published: (2021)
Similar Items
-
Improved Parallel Approximation of a Class of Integer Programming Problems
by: Alon, N., et al.
Published: (2014) -
Approximating low-congestion routing and column-restricted packing problems
by: Baveja, A., et al.
Published: (2013) -
Improving mixed integer linear programming formulations
by: Khurana, A., et al.
Published: (2014) -
Quantitative conditions do not guarantee the validity of the adiabatic approximation
by: Tong, D.M., et al.
Published: (2014) -
An integer linear programming approach for a class of bilinear integer programs
by: Hu, Wuhua, et al.
Published: (2014)