The following pages link to Jens Vygen (Q226822):
Displaying 10 items.
- 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)
- Faster min-max resource sharing in theory and practice (Q542051) (← links)
- Splitting trees at vertices (Q616363) (← 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)
- The repeater tree construction problem (Q1675870) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Packing cycles in planar and bounded-genus graphs (Q6507883) (← links)
- Cost Allocation for Set Covering: the Happy Nucleolus (Q6516600) (← links)
