Pages that link to "Item:Q2921679"
From MaRDI portal
The following pages link to Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes (Q2921679):
Displaying 9 items.
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- A note on maximum independent set and related problems on box graphs (Q835020) (← links)
- Competitive algorithms for multistage online scheduling (Q1753459) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Extremal Results on Intersection Graphs of Boxes in $${\mathbb R}^d$$ R d (Q5354940) (← links)
- The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes (Q5454268) (← links)
- Temporal interval cliques and independent sets (Q6039892) (← links)
