Pages that link to "Item:Q5900924"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900924):
Displayed 21 items.
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- On the complexity of wafer-to-wafer integration (Q1751193) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents (Q2237895) (← links)
- On tree-constrained matchings and generalizations (Q2258075) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Competitive router scheduling with structured data (Q2440162) (← links)
- The minimum-entropy set cover problem (Q2581268) (← links)
- On the Complexity of Wafer-to-Wafer Integration (Q2947021) (← links)
- Dissection with the Fewest Pieces is Hard, Even to Approximate (Q2958085) (← links)
- On Tree-Constrained Matchings and Generalizations (Q3012795) (← links)
- Scheduling to Maximize Participation (Q3608460) (← links)
- Overflow management with self-eliminations (Q5918714) (← links)
- Overflow management with self-eliminations (Q5925615) (← links)
- Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)