- UPGRADING BOTTLENECK CONSTRAINED FORESTS S. O. KRUMKE, M. V. MARATHE, H. NOLTEMEIER, S. S. RAVI,
- On the Approximability of Location and
- Lehramtsbez. Bachelorstudiengang LAG oder LAR -Module im Fach Mathematik -
- Mathematik ist mehr als Rechnen! Das sind alles Sachen, bei denen Kinder
- Reoptimization Gaps versus Model Errors in OnlineDispatching of Service Units for
- Modulhandbuch fr die Masterstudiengnge fr das Lehramt an Gymnasien (Gym),
- Grundstudium Bachelor Modulnummer SWS BemerkungenBetreuer Gruppen Vorlesungen
- Complexity of the Traveling Tournament Problem
- Improving Spanning Trees by Upgrading Nodes S. O. Krumke, 1 M. V. Marathe, 2 H. Noltemeier, 1
- Title, authors and addresses use the thanksref command within ,
- ,,Chega de Saudade" (A. C. Jobim), ,,Orpheo Negro" (L. Bonfi) Hubert Gro Quartett*
- Online Optimierung Sven O. Krumke
- On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem
- Fachbereich Mathematik Wintersemester 2007/08, Blatt 4 Thomas Markwig
- Euler is Standing in Line Dial-a-Ride Problems with
- Finding Tree--2--Spanners S.O. Krumke J. Valenta
- 4Newton-Like Methods Suppose we want to solve the problem
- Programm des SdwestWorkshops Operations Research am 13. Februar 2009 in Lambrecht Von Bis Vortragende Titel
- Advanced Combinatorial Algorithms Sven O. Krumke
- How to cut a cake almost fairly Sven O. Krumke Maarten Lipman y Willem E. de Paepe z Diana Poensgen x
- News from the Online Traveling Repairman Sven O. Krumke1
- Fachbereich Mathematik Wintersemester 2007/08, Blatt 13 Thomas Markwig
- Modifying Networks to Obtain Low Cost Trees S. O. Krumke 1 H. Noltemeier 1 M. V. Marathe 2 S. S. Ravi 3 K. U. Drangmeister 1
- News from the Online Traveling Repairman Sven O. Krumke a;1 Willem E. de Paepe b Diana Poensgen a
- Multiple Hotlink Assignment Sven Fuhrmann 1 , Sven Oliver Krumke 2 , and Hans-Christoph Wirth 1
- Improving Minimum Cost Spanning Trees by Upgrading S. O. Krumke
- A Basic UNIX Tutorial This tutorial comprises fourteen sections, each of which addresses a fundamental aspect of UNIX
- Approximation Algorithms for Channel Assignment in Radio Networks 1
- On a Generalization of the p--Center Problem S.O. Krumke
- 6Relaxations and Bounds 6.1 Optimality and Relaxations
- Network Improvement Problems Sven O. Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi,
- Martin Bracke Sven O. Krumke Jean-Pierre Stockis Vorkurs Mathematik
- How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- Fachbereich Mathematik Sommersemester 2010, Blatt 14 Thomas Markwig Stefan Steidel
- Fachbereich Mathematik Sommersemester 2010, Blatt 15 Thomas Markwig Stefan Steidel
- Grundlagen der Mathematik I -II Kaiserslautern WS 2009/2010-SS 2010
- Was hat der Nobelpreis mit fairem Kuchenteilen zu tun?
- ON THE MINIMUM LABEL SPANNING TREE PROBLEM SVEN O. KRUMKE AND HANS-CHRISTOPH WIRTH
- Budgeted Maximum Graph Coverage Sven Oliver Krumke ?2 , Madhav V. Marathe 3 , Diana Poensgen 2 , S. S. Ravi ??4 ,
- NETWORK DESIGN AND IMPROVEMENT
- NonAbusiveness Helps: An O(1)Competitive Algorithm for Minimizing the Maximum Flow
- IMPROVEDPRUNING IN COLUMNGENERATION OF A VEHICLE ROUTING PROBLEM
- Deterministic Online Optical Call Admission Revisited #
- Compact Location Problems with Budget and Communication Constraints
- A monotone approximation algorithm for scheduling with precedence constraints
- The Online-TSP Against Fair Adversaries Michiel Blom 1? , Sven O. Krumke 2?? , Willem de Paepe 3 , and Leen Stougie 4? ? ?
- Improving Minimum Cost Spanning Trees by Upgrading Nodes \Lambda
- Annals of Operations Research manuscript No. (will be inserted by the editor)
- Mathematical Optimization Based Channel Coding: Current Achievements and Future Challenges
- Eine modifizierte Barrieremethode konvexe quadratische Optimierungsprobleme
- Online Call Admission in Optical Networks with Larger Demands
- Mathematik AG Wie teilt man einen Kuchen fair?
- New Lower Bounds for Online k-Server Routing Problems
- How to Whack Moles 1 Sandra Gutierrez a,2
- A Hard Dial-a-Ride Problem that is Easy on Average Amin Coja-Oghlan1
- BUDGET CONSTRAINED MINIMUM COST CONNECTED MEDIANS GORAN KONJEVOD
- Bicriteria Compact Location Problems S.O. Krumke1, H. Noltemeier1, S.S. Ravi2 and M.V. Marathe3
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with
- Improved Construction Heuristics and Iterated Local Search for the Routing and
- Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
- The Online Target Date Assignment Problem , S.O. Krumke2
- Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for
- Topology Control Problems Under Symmetric and Asymmetric Power Thresholds
- A Heuristic for the Stacker Crane Problem on Trees which is Almost Surely Exact
- Online Call Admission in Optical Networks with Larger Demands
- 1. Decomposition Techniques with Subproblem Truncation Typical decomposition techniques separate a monolithic optimization problem into master and
- Takustrae 7 D-14195 Berlin-Dahlem
- Der A-Algorithmus Voraussetzung 1.1 V ist eine Zustandsmenge mit |N(v)| < + fur alle v
- Sven O. Krumke Integer Programming
- In this chapter we introduce some of the basic concepts that will be useful for the study of integer programming problems.
- 3.8 The Characteristic Cone and Extreme Rays 39 3.8 The Characteristic Cone and Extreme Rays
- 50 Integrality of Polyhedra Theorem 4.7 (Birkhoff's Theorem) Let G be a bipartite graph. Then, conv(PM(G)) =
- 6.4 Duality 91 are redundant. As a consequence, we can drop all subtour constraints with 1 S. This gives
- 8Branch and Bound 8.1 Divide and Conquer
- Mathematik AG Wie verschickt man als Agent geheime
- J.P. D. S R .KAISERSLAUTERN
- Fachbereich Mathematik Tag der Mathematik 2010
- Modulhandbuch fr den lehramtsbezogenen Bachelorstudiengang
- Lehramtsbezogener Bachelorstudiengang -Fach Mathematik (berufsbild. Schulen) Modul CP Prfungsfach fr Modulprfung Studienleistungen 0)
- Masterstudiengang fr das Lehramt an Gymnasien -Fach Mathematik Modul Lp Prfungsfach fr Modulprfg. Studienleistungen
- Application for Admission to Studies for Foreign Applicants for the Winter Semester 2011 / 2012 at the University of Kaiserslautern
- Welcome at the Department of Mathematics
- Fachbereich Mathematik Wintersemester 2007/08, Blatt 10 Thomas Markwig
- Lehramtsbezogener Bachelorstudiengang -Fach Mathematik (Gymnasien/Realschulen) Modul CP Prfungsfach fr Modulprfung Studienleistungen 0)
- Online Optimization Competitive Analysis and Beyond
- 3Descent Methods 3.1 One-Dimensional Minimization, Direct Search
- Network Improvement Problems Sven O. Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi,
- How to Whack Moles # Sven O. Krumke 1,## , Nicole Megow 2 , and Tjark Vredeveld 1
- A Hard DialaRide Problem that is Easy on Average Amin CojaOghlan 1# , Sven O. Krumke 2## , and Till Nierhoff 1# # #
- Improving Spanning Trees by Upgrading Nodes
- Complexity and Approximability of Certain Bicriteria Location Problems
- 2Minimization without Constraints In Part I we consider optimization problems of the form
- On the Approximability of Location and
- 1Introduction Linear Programs can be used to model a large number of problems arising in practice. A
- 3Polyhedra and Integer Programs 3.1 Valid Inequalities and Faces of Polyhedra
- Technische Universitt Kaiserslautern Modulhandbuch Bachelorstudiengang Mathematik Modulhandbuch fr den
- Node Weighted Network Upgrade Problems (Extended Abstract)
- Compact Location Problems \Lambda (Extended Abstract)
- A Heuristic for the Stacker Crane Problem on Trees which is Almost Surely Exact
- Online Dial-a-Ride Problems: Minimizing the Completion Time ?
- Mathematik AG Wie verschickt man als Agent geheime
- Ordnung der Zwischenprfung im Fach Mathematik fr die Studiengnge
- Randomisierte Algorithmen Probabilistische Analyse
- REAL-TIME DISPATCHING OF GUIDED AND UNGUIDED AUTOMOBILE SERVICE UNITS WITH SOFT TIME WINDOWS
- Non-Abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow
- 1Introduction Linear Programs can be used to model a large number of problems arising in practice. A
- 7Dynamic Programming 7.1 Shortest Paths Revisited
- Flow Improvement and Network Flows with Fixed Costs S. O. Krumke, KonradZuseZentrum fur Informationstechnik Berlin
- Fachbereich Mathematik Tag der Mathematik 2008
- 5Basics about Problems and Complexity 5.1 Encoding Schemes, Problems and Instances
- Ordnung fr die Diplomprfung in Mathematik, Technomathematik und Wirtschaftsmathematik
- Algorithmen und Datenstrukturen Sven O. Krumke
- Welcome at the Department of mathematics
- Modifying Edges of a Network to Obtain Short Subgraphs
- Sven O. Krumke On the Convergence of a Modified Barrier Function Method for Convex
- Fachbereich Mathematik Wintersemester 2007/08, Blatt 6 Thomas Markwig
- Deterministic Online Optical Call Admission Elisabeth Gassner1
- Martin Bracke Welche Mannschaft ist die Beste?
- The Online Dial-a-Ride Problem under Reasonable Load ?
- Bicriteria Compact Location Problems S.O. Krumke 1 , H. Noltemeier 1 , S.S. Ravi 2 and M.V. Marathe 3
- , , 1{35 () Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- A DECOMPOSITION-BASED PSEUDOAPPROXIMATION ALGORITHM
- 9Cutting Planes Let P = x Rn
- Sven O. Krumke Das PCP-Light-Theorem
- Semi-Preemptive Routing on Trees Sven O. Krumke a
- Compact Location Problems 5 S. O. Krumke 1 M. V. Marathe 2 H. Noltemeier 1
- How to Whack Moles Sven O. Krumke1,
- 4Integrality of Polyhedra In this chapter we study properties of polyhedra P which ensure that the Linear Program
- Technische Universitt Kaiserslautern Modulhandbuch Masterstudiengnge Mathematik Modulhandbuch fr die
- Title, authors and addresses use the thanksref command within ,
- Fachbereich Mathematik Sommersemester 2010, Blatt 16 Thomas Markwig Stefan Steidel
- Fachbereich Mathematik Wintersemester 2007/08, Blatt 4 Thomas Markwig
- Online Bin Coloring Sven O. Krumke ?1 , Willem E. de Paepe 2 , Jorg Rambau 1 , and Leen Stougie ??3
- REALTIME DISPATCHING OF GUIDED AND UNGUIDED AUTOMOBILE SERVICE UNITS WITH SOFT TIME WINDOWS
- How to Whack Moles 1 Sandra Gutierrez a,2 Sven O. Krumke b,3 Nicole Megow d
- On BudgetConstrained Flow Improvement Department of Computer Science, University of Wurzburg, Am Hubland,
- Upgrading Bottleneck Constrained Forests S. O. Krumke 1 , M. V. Marathe 2 , H. Noltemeier 3 , S. S. Ravi 4 , and H.C. Wirth 3
- Fachbereich Mathematik Wintersemester 2007/08, Blatt 6 Thomas Markwig
- Fachbereich Mathematik Wintersemester 2007/08, Blatt 10 Thomas Markwig
- The Online Target Date Assignment Problem # S. Heinz 1 , S.O. Krumke 2 , N. Megow 3 , J. Rambau 1 , A. Tuchscherer 1 , and
- A Heuristic for the Stacker Crane Problem on Trees which is Almost Surely Exact
- Fachbereich Mathematik Wintersemester 2007/08, Blatt 13 Thomas Markwig
- A DECOMPOSITIONBASED PSEUDOAPPROXIMATION ALGORITHM
- Mathematik AG Geschickt gesucht ist halb gefunden
- ONLINE JOB ADMISSION SVEN O. KRUMKE
- at 12/2002 ANWENDUNGSAUFSATZ Probieren geht ber Studieren?
- News from the Online Traveling Repairman Sven O. Krumke #1 , Willem E. de Paepe 2 , Diana Poensgen 1 , and
- Euler is Standing in Line Dial-a-Ride Problems with Precedence-Constraints
- Improving Steiner Trees of a Network Under Multiple Constraints
- IMPROVED PRUNING IN COLUMN GENERATION OF A VEHICLE ROUTING PROBLEM
- Bachelorstudiengang Mathematik vert. Fachgebiet: _______________________ (nur Leistungen in Mathematik sind aufgefhrt; hinzu kommen 35 LP im Anwendungsfach und in Informatik)
- A Heuristic for the Stacker Crane Problem on Trees which is Almost Surely Exact
- The Online TSP Against Fair Adversaries Michiel Blom Sven O. Krumke Willem E. de Paepe Leen Stougie
- BUDGET CONSTRAINED MINIMUM COST CONNECTED MEDIANS GORAN KONJEVOD 1 , SVEN O. KRUMKE 2 , AND MADHAV MARATHE 3
- Online Optimization Competitive Analysis and Beyond
- Mathematical Methods of Operations Research manuscript No. (will be inserted by the editor)
- 29 1.Semester 31 2.Semester 31 3.Semester 29 4.Semester 32 5.Semester 30 6.Semester 28 7.Semester LP SWS LP SWS LP SWS LP SWS LP SWS LP SWS LP SWS
- 29 1.Semester 31 2.Semester 31 3.Semester 29 4.Semester 33 5.Semester 31 6.Semester 26 7.Semester LP SWS LP SWS LP SWS LP SWS LP SWS LP SWS LP SWS
- Optimality Conditions 5Convexity and Separation Theorems
- Equilibria With Finitely Many Agents
- Fachbereich Mathematik Dr. J. Trk
- Fachbereich Mathematik Tag der Mathematik 2006
- Arbeitsgruppe Optimierung Ein Stundenplan, der alle zufrieden stellt
- Tag der Mathematik 2004 Finanzzeitreihen -Risiken und Chancen Professor Dr. Jrgen Franke
- Technische Universitt Kaiserslautern Fachbereich Mathematik
- TU Kaiserslautern Fachbereich Mathematik
- Technische Universitt Kaiserslautern 17. Januar 2012 Fachbereich Mathematik
- Horst W. HamacherNetwork Optimization, SS 2004 Page 1 Platzierung von
