Pages that link to "Item:Q1593534"
From MaRDI portal
The following pages link to Approximability of hard combinatorial optimization problems: an introduction (Q1593534):
Displaying 11 items.
- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint (Q687374) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes (Q2921679) (← links)
- (Q3132650) (← links)
- (Q3340632) (← links)
- On Approximate Solutions for Combinatorial Optimization Problems (Q3477970) (← links)
- (Q4414639) (← links)
- (Q4549232) (← links)
- Advances in Combinatorial Optimization (Q5744058) (← links)
- Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)