Vygen, Jens.
Vygen, Jens, 1967-....
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
Jens Vygen
VIAF ID: 14995981 (Personal)
Permalink: http://viaf.org/viaf/14995981
Preferred Forms
-
100 0 _
‡a
Jens Vygen
-
200 _ |
‡a
Vygen
‡b
Jens
-
100 1 _ ‡a Vygen, Jens
-
100 1 _
‡a
Vygen, Jens
-
100 1 _ ‡a Vygen, Jens
-
100 1 _ ‡a Vygen, Jens
-
100 1 _
‡a
Vygen, Jens
-
100 1 _
‡a
Vygen, Jens
-
100 1 _ ‡a Vygen, Jens
-
100 1 _ ‡a Vygen, Jens
-
100 1 _ ‡a Vygen, Jens
-
100 1 _
‡a
Vygen, Jens
‡d
1967-
-
100 1 _
‡a
Vygen, Jens
‡d
1967-
-
100 1 _
‡a
Vygen, Jens
‡d
1967-
-
100 1 _ ‡a Vygen, Jens, ‡d 1967-
-
100 1 _
‡a
Vygen, Jens,
‡d
1967-....
-
100 1 _ ‡a Vygen, Jens.
4xx's: Alternate Name Forms (19)
5xx's: Related Names (6)
- 551 _ _
‡a
Bonn
‡4
ortw
‡4
https://d-nb.info/standards/elementset/gnd#placeOfActivity
- 551 _ _
‡a
Duisburg
‡4
ortg
‡4
https://d-nb.info/standards/elementset/gnd#placeOfBirth
- 510 2 _
‡a
Rheinische Friedrich-Wilhelms-Universität Bonn
‡4
affi
‡4
https://d-nb.info/standards/elementset/gnd#affiliation
‡e
Affiliation
- 510 2 _
‡a
Springer Science+Business Media
- 510 2 _
‡a
Springer-Verlag (Berlin)
- 510 2 _
‡a
Universität Bonn
Works
| Title | Sources |
|---|---|
| Algorithmische Mathematik |
|
| Approaching 3/2 for the s-t-path TSP |
|
| Approximating the discrete time-cost tradeoff problem with bounded depth |
|
| approximation algorithm for threshold voltage optimization |
|
| Approximation algorithms for network design and facility location with service capacities |
|
| Approximation maximum integral multiflows on bounded genus graphs |
|
| The asymmetric traveling salesman path LP has constant integrality ratio |
|
| Beating the integrality ratio for s-t-tours in graphs |
|
| Better s-t tours by Gao trees |
|
| BonnPlace: placement of leading-edge chips by advanced combinatorial algorithms |
|
| Bonntools: mathematical innovation for layout and timing closure of systems on a chip |
|
| Combinatorial Optimization Theory and Algorithms |
|
| Combinatorial problems in chip design |
|
| Continuous Routing |
|
| d-dimensional arrangement revisited |
|
| Edge disjoint paths in series parallel graphs |
|
| Efficient Detailed Routing on Optimized Tracks |
|
| Faster algorithm for optimum Steiner trees |
|
| Faster goal-oriented shortest path search for bulk and incremental detailed routing |
|
| Faster min-max resource sharing in theory and practice |
|
| Few sequence pairs suffice representing all rectangle placements |
|
| Four-way partitioning of two-dimensional sets |
|
| From stars to comets improved local search for universal facility location |
|
| generalization of Dijkstra's shortest path algorithm with applications to VLSI routing |
|
| Global routing with inherent static timing constraints |
|
| Improving the Approximation Ratio for Capacitated Vehicle Routing |
|
| Kumiawase saitekika : Riron to arugorizumu. |
|
| Legalizing a placement with minimum total movement |
|
| n00011223 |
|
| Near optimum global routing with coupling, delay bounds, and power consumption |
|
| New theoretical results on quadratic placement |
|
| note on Schrijver's submodular function minimization algorithm |
|
| NP-completeness of some edge disjoint paths problems |
|
| On dual minimum cost flow algorithms |
|
| On the complexity of bin packing, scheduling, and placement |
|
| On the integrality gap of the prize-collecting Steiner forest LP |
|
| Ottimizzazione combinatoria : teoria e algoritmi |
|
| Plazierung im VLSI-Design und ein zweidimensionales Zerlegungsproblem |
|
| Reassembling trees for the traveling salesman |
|
| Reducing path TSP to TSP |
|
| 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 |
|
| Slack in static timing analysis |
|
| Splitting trees at vertices |
|
| tutorial on VLSI placement |
|
| Two-connected spanning subgraphs with at most 10/7 OPT edges |
|
| Vehicle routing with subtours |
|
| Worst case ratios of networks in the rectlinear plane |
|
| 組合せ最適化 : 理論とアルゴリズム |
|
