The following pages link to (Q3048571):
Displaying 35 items.
- Perfect matchings in hexagonal systems (Q5896369) (← links)
- On a classification of independence systems (Q5902624) (← links)
- On a classification of independence systems (Q5904597) (← links)
- The complexity of linear programming (Q5904897) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)
- Online facility assignment (Q5919330) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- Distributed MST for constant diameter graphs (Q5919895) (← links)
- Robust partial inverse network flow problems (Q5943384) (← links)
- The complexity of bottleneck labeled graph problems (Q5961969) (← links)
- Blocking trails for \(f\)-factors of multigraphs (Q6046949) (← links)
- A weight-scaling algorithm for \(f\)-factors of multigraphs (Q6046950) (← links)
- Feedback vertex set reconfiguration in planar graphs (Q6057837) (← links)
- Optimal hierarchical clustering on a graph (Q6065857) (← links)
- Probabilistic analysis of optimization problems on sparse random shortest path metrics (Q6088299) (← links)
- Maximum skew-symmetric flows (Q6102298) (← links)
- The online transportation problem (Q6102324) (← links)
- Mathematical aspects of the Digital Annealer's simulated annealing algorithm (Q6140923) (← links)
- Two remarks on the optimum arborescence problem (Q6155599) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)
- A local search approximation algorithm for the multiway cut problem (Q6166037) (← links)
- Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)
- Computing fair and bottleneck matchings in geometric graphs (Q6487431) (← links)
- Approximation algorithms for the maximum-weight cycle/path packing problems (Q6542868) (← links)
- A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints (Q6556160) (← links)
- Aunt's problem: table rounding (Q6560198) (← links)
- Finding the K mean-standard deviation shortest paths under travel time uncertainty (Q6569063) (← links)
- Improved approximation algorithms for cycle and path packings (Q6575393) (← links)
- A deterministic approximation algorithm for metric triangle packing (Q6589849) (← links)
- Optimal Dorfman group testing for symmetric distributions (Q6617267) (← links)
- An improved approximation algorithm for metric triangle packing (Q6636067) (← links)
- On the enumeration of non-dominated matroids with imprecise weights (Q6638831) (← links)
- Algebraic algorithms for fractional linear matroid parity via noncommutative rank (Q6670353) (← links)
- Euclidean maximum matchings in the plane -- local to global (Q6670815) (← links)
