The following pages link to Alantha Newman (Q896294):
Displayed 26 items.
- On the configuration LP for maximum budgeted allocation (Q896296) (← links)
- Domination and fractional domination in digraphs (Q1671654) (← links)
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
- Traveling salesman path problems (Q2476987) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q2921458) (← links)
- Graph-TSP from Steiner Cycles (Q2945200) (← links)
- (Q4537753) (← links)
- The Alternating Stock Size Problem and the Gasoline Puzzle (Q4554346) (← links)
- (Q4606344) (← links)
- (Q4780790) (← links)
- (Q4829025) (← links)
- (Q5075801) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- (Q5240428) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313022) (← links)
- (Q5365142) (← links)
- On the Configuration LP for Maximum Budgeted Allocation (Q5419007) (← links)
- Algorithms and Computation (Q5897900) (← links)
- Aggregating inconsistent information (Q5899505) (← links)
- Aggregating inconsistent information (Q5901110) (← links)
- LATIN 2004: Theoretical Informatics (Q5901657) (← links)
- Coloring dense digraphs (Q5915818) (← links)
- Coloring dense digraphs (Q5919339) (← links)