scientific article; zbMATH DE number 1305459

MaRDI QIDQ4252345zbMATH OpenFDO

Authors Chi-Jen Lu

Publication date 14 February 2000

zbMATH Keywords

deterministic polynomial time approximation algorithmdivide and conquer approacheshypergraph coloringminmax integer programming problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Recommendations

• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Approximating low-congestion routing and column-restricted packing problems
• Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems
• Deterministic Hypergraph Coloring and Its Applications
• scientific article; zbMATH DE number 1301963

Cited in

(5)

• Approximating low-congestion routing and column-restricted packing problems
• A Deterministic Reduction for the Gap Minimum Distance Problem
• Technical Note—On Min-Max Integer Allocation Problems
• scientific article; zbMATH DE number 3970510 (Why is no real title available?)
• Integer programming approaches for minimum stabbing problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252345)