The following pages link to (Q2708231):
Displayed 17 items.
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Hardness of approximation for non-overlapping local alignments. (Q1427808) (← links)
- Competitive algorithms for multistage online scheduling (Q1753459) (← links)
- Towards better models of externalities in sponsored search auctions (Q1786603) (← links)
- Local search algorithms for the maximum carpool matching problem (Q2205630) (← links)
- Competitive router scheduling with structured data (Q2440162) (← links)
- An approximation algorithm for maximum triangle packing (Q2492197) (← links)
- A modified greedy algorithm for dispersively weighted 3-set cover (Q2492216) (← links)
- How heavy independent sets help to find arborescences with many leaves in DAGs (Q2698292) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Technical Note—Online Hypergraph Matching with Delays (Q5106363) (← links)
- Overflow management with self-eliminations (Q5918714) (← links)
- Overflow management with self-eliminations (Q5925615) (← links)