The following pages link to Jens Vygen (Q226822):
Displayed 50 items.
- (Q484551) (redirect page) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Algorithmic mathematics (Q495037) (← links)
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- (Q589080) (redirect page) (← links)
- Splitting trees at vertices (Q616363) (← links)
- Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip (Q697566) (← links)
- Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022) (← links)
- On dual minimum cost flow algorithms (Q1396922) (← links)
- A note on Schrijver's submodular function minimization algorithm. (Q1400972) (← links)
- Combinatorial optimization. Theory and algorithms. Translated from the 6th English edition by Ulrich Brenner and Rabe von Randow (Q1650106) (← links)
- (Q1675869) (redirect page) (← links)
- The repeater tree construction problem (Q1675870) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
- NP-completeness of some edge-disjoint paths problems (Q1897369) (← links)
- Faster algorithm for optimum Steiner trees (Q1944205) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- Faster goal-oriented shortest path search for bulk and incremental detailed routing (Q2164671) (← links)
- An improved upper bound on the integrality ratio for the \(s\)-\(t\)-path TSP (Q2294304) (← links)
- \(d\)-dimensional arrangement revisited (Q2444745) (← links)
- From stars to comets: improved local search for universal facility location (Q2457256) (← links)
- Combinatorial optimization. Theory and applications. (Q2574644) (← links)
- Worst-case ratios of networks in the rectilinear plane (Q2764995) (← links)
- Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
- Algorithmic Mathematics (Q2818820) (← links)
- (Q2928707) (← links)
- Chip-Design und Mathematik (Q3001830) (← links)
- Mathematics of Chip Design (Q3064918) (← links)
- (Q3116952) (← links)
- Better s-t-Tours by Gao Trees (Q3186497) (← links)
- On dual minimum cost flow algorithms (extended abstract) (Q3191978) (← links)
- Kombinatorische Optimierung (Q3509951) (← links)
- Ottimizzazione Combinatoria (Q3579820) (← links)
- Combinatorial Problems in Chip Design (Q3601928) (← links)
- (Q3655277) (← links)
- (Q4350682) (← links)
- (Q4360320) (← links)
- Algorithmische Mathematik (Q4571845) (← links)
- Approaching $\frac{3}{2}$ for the $s$-$t$-path TSP (Q4608010) (← links)
- Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm (Q4946702) (← links)
- Approximation algorithms for a facility location problem with service capacities (Q4962755) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- Few Sequence Pairs Suffice: Representing All Rectangle Placements (Q5128501) (← links)
- An improved approximation algorithm for ATSP (Q5144891) (← links)
- Reducing path TSP to TSP (Q5144892) (← links)
- Approaching 3/2 for the <i>s</i> - <i>t</i> -path TSP (Q5244387) (← links)
- Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges (Q5351864) (← links)