The following pages link to Walter Kern (Q170461):
Displaying 50 items.
- Approximate core allocations and integrality gap for the bin packing game (Q265072) (← links)
- A note on perfect partial elimination (Q389218) (← links)
- On bounded block decomposition problems for under-specified systems of equations (Q414888) (← links)
- Computing solutions for matching games (Q662281) (← links)
- An improved deterministic local search algorithm for 3-SAT (Q706635) (← links)
- (Q803142) (redirect page) (← links)
- On adjoints and dual matroids (Q803143) (← links)
- Some order dimension bounds for communication complexity problems (Q921909) (← links)
- Quadratic programming and combinatorial minimum weight product problems (Q985315) (← links)
- Adjoints of oriented matroids (Q1092910) (← links)
- Extension equivalence of oriented matroids (Q1093648) (← links)
- On sticky matroids (Q1100208) (← links)
- On finite locally projective planar spaces (Q1107817) (← links)
- A probabilistic analysis of the switching algorithm for the Euclidean TSP (Q1122505) (← links)
- Linear programming duality: an introduction to oriented matroids (Q1189586) (← links)
- Learning convex bodies under uniform distribution (Q1198007) (← links)
- The Shapley value for cooperative games under precedence constraints (Q1202565) (← links)
- The nucleon of cooperative games and an algorithm for matching games (Q1290660) (← links)
- A guided tour through oriented matroid axioms (Q1314943) (← links)
- Scheduling jobs with release times on a machine with finite storage (Q1330556) (← links)
- On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- Note on the computational complexity of least core concepts for min-cost spanning tree games. (Q1403160) (← links)
- On the computation of the nucleolus of a cooperative game (Q1414387) (← links)
- On the core of ordered submodular cost games (Q1575071) (← links)
- Simple games versus weighted voting games (Q1617644) (← links)
- The asymptotic price of anarchy for \(k\)-uniform congestion games (Q1644955) (← links)
- The stable fixtures problem with payments (Q1651275) (← links)
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Greedy oriented flows (Q1751094) (← links)
- Integrality gap analysis for bin packing games (Q1758278) (← links)
- Online matching on a line (Q1770389) (← links)
- On the depth of combinatorial optimization problems (Q1801676) (← links)
- A random polynomial time algorithm for well-routing convex bodies (Q1805452) (← links)
- Matroid matching in pseudomodular lattices (Q1812751) (← links)
- Note on the game chromatic index of trees (Q1884997) (← links)
- On the average rank of LYM-sets (Q1898339) (← links)
- Randomized online algorithms for maximizing busy time interval scheduling (Q1909593) (← links)
- Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\) (Q1915805) (← links)
- Submodular linear programs on forests (Q1919093) (← links)
- Computing the nucleolus of min-cost spanning tree games is NP-hard. (Q1972596) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- Improved lower bound for online strip packing (Q2344211) (← links)
- Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
- The computational complexity of the elimination problem in generalized sports competitions (Q2386202) (← links)
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing (Q2392732) (← links)
- A ranking model for the greedy algorithm and discrete convexity (Q2429474) (← links)
- Note on non-uniform bin packing games (Q2448901) (← links)
- Solutions for the stable roommates problem with payments (Q2453162) (← links)
- The number of tree stars is \(O^{*}(1.357^k)\) (Q2461549) (← links)
