The following pages link to Alexander Hall (Q1877702):
Displayed 16 items.
- Call control with \(k\) rejections (Q1877703) (← links)
- Sequential vector packing (Q2378514) (← links)
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow (Q2464420) (← links)
- (Q2934674) (← links)
- (Q3002790) (← links)
- Call Control with k Rejections (Q3046505) (← links)
- Length-bounded cuts and flows (Q3188986) (← links)
- The Maximum Energy-Constrained Dynamic Flow Problem (Q3512452) (← links)
- Incentive-Compatible Interdomain Routing with Linear Utilities (Q3574303) (← links)
- How to Guard a Graph? (Q3596729) (← links)
- Approximate Discovery of Random Graphs (Q3608500) (← links)
- Sequential Vector Packing (Q3611892) (← links)
- Length-Bounded Cuts and Flows (Q3613800) (← links)
- (Q4426352) (← links)
- Cuts and Disjoint Paths in the Valley-Free Path Model (Q5384925) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479363) (← links)