Approximating the discrete time-cost tradeoff problem with bounded depth

DOI10.1007/s10107-022-01777-9OpenAlexW3095065183MaRDI QIDQ5925637

Jens Vygen, Stephan Held, Siad Daboul

Publication date: 14 March 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-022-01777-9

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
• Project scheduling with irregular costs: complexity, approximability, and algorithms
• A class of simple games
• On the hardness of approximating minimum vertex cover
• The ellipsoid method and its consequences in combinatorial optimization
• Some APX-completeness results for cubic graphs
• Hardness of approximation of the discrete time-cost tradeoff problem
• On a theorem of Lovász on covers in \(r\)-partite hypergraphs
• Minimum \(k\)-path vertex cover
• Partitioning a graph into small pieces with applications to path transversal
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
• Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
• Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs
• A linear-time approximation algorithm for the weighted vertex cover problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Bottleneck extrema
• On some techniques useful for solution of transportation network problems