The following pages link to (Q4535060):
Displaying 8 items.
- Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- (Q2934675) (← links)
- (Q3105838) (← links)
- Fractional path coloring in bounded degree trees with applications (Q5961980) (← links)
