The following pages link to Olivier Goldschmidt (Q1267193):
Displaying 10 items.
- A new and improved algorithm for the 3-cut problem (Q1267194) (← links)
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem (Q1278276) (← links)
- A modified greedy heuristic for the set covering problem with improved worst case bound (Q1334632) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- Local optimality and its application on independent sets for \(k\)-claw free graphs (Q1369747) (← links)
- SONET/SDH ring assignment with capacity constraints (Q1399114) (← links)
- Randomized methods for the number partitioning problem (Q2563882) (← links)
- Combinatorial Issues in Air Traffic Optimization (Q2783815) (← links)
- A Fast Perfect-Matching Algorithm in Random Graphs (Q3360222) (← links)
- The SONET edge‐partition problem (Q4797943) (← links)
