The following pages link to Walter Kern (Q170461):
Displaying 47 items.
- Dynamic programming for minimum Steiner trees (Q2464320) (← links)
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792) (← links)
- Computing an element in the lexicographic kernel of a game (Q2474551) (← links)
- Quality of move-optimal schedules for minimizing total weighted completion time (Q2480059) (← links)
- (Q2816016) (← links)
- The Stable Fixtures Problem with Payments (Q2827801) (← links)
- Improved Lower Bound for Online Strip Packing (Q2896391) (← links)
- Improved Approximation Algorithms for a Bilevel Knapsack Problem (Q2920469) (← links)
- On Greedy and Submodular Matrices (Q2999339) (← links)
- Improved Taxation Rate for Bin Packing Games (Q2999344) (← links)
- (Q3031924) (← links)
- On some approximately balanced combinatorial cooperative games (Q3142154) (← links)
- On the Core and <i>f</i>-Nucleolus of Flow Games (Q3169076) (← links)
- (Q3337482) (← links)
- Quadratic Programming and Combinatorial Minimum Weight Product Problems (Q3434541) (← links)
- An improved local search algorithm for 3-SAT (Q3439130) (← links)
- The number of tree stars is O*(1.357k) (Q3439499) (← links)
- Optimization and optimality test for the Max-Cut Problem (Q3479833) (← links)
- On Solution Concepts for Matching Games (Q3569069) (← links)
- (Q3749070) (← links)
- On the Rate of Convergence of Some Stochastic Processes (Q3827314) (← links)
- Note on the Convergence of Simulated Annealing Algorithms (Q3977037) (← links)
- Some Convergence Results for Probabilistic Tabu Search (Q3993664) (← links)
- Approximate Core Allocation for Binpacking Games (Q4210213) (← links)
- (Q4233335) (← links)
- A Greedy On-Line Algorithm for thek-Track Assignment Problem (Q4240132) (← links)
- A Group-Theoretic Setting for Some Intersecting Sperner Families (Q4291192) (← links)
- Modular Substructures in Pseudomodular Lattices. (Q4318050) (← links)
- Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints (Q4319758) (← links)
- (Q4780783) (← links)
- (Q4786439) (← links)
- A Characterization of Nonnegative Box-Greedy Matrices (Q4875430) (← links)
- (Q4882998) (← links)
- The 1/4-Core of the Uniform Bin Packing Game Is Nonempty (Q4925224) (← links)
- Approximation schemes for wireless networks (Q4962754) (← links)
- Solutions for the Stable Roommates Problem with Payments (Q5200495) (← links)
- Matching Games: The Least Core and the Nucleolus (Q5704127) (← links)
- (Q5708535) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710802) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- The new FIFA rules are hard: Complexity aspects of sports competitions. (Q5929315) (← links)
- An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games (Q5935839) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- On a problem about covering lines by squares (Q5948105) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- On a problem about covering lines by squares (Q6377050) (← links)
