default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven Oliver Krumke
Sven O. Krumke
Person information
- affiliation: University of Kaiserslautern
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j71]Shai Michael Dimant, Sven O. Krumke:
On approximating partial scenario set cover. Theor. Comput. Sci. 1023: 114891 (2025)- 2024
- [j70]Sebastian S. Johann, Sven O. Krumke, Manuel Streicher
:
On the mixed connectivity conjecture of Beineke and Harary. Ann. Oper. Res. 332(1): 107-124 (2024) - [j69]Rebekka Haese, Till Heller, Sven O. Krumke:
Algorithms and complexity for the almost equal maximum flow problem. Networks 83(4): 642-652 (2024) - [j68]Oliver Bachtler, Tim Bergner, Sven O. Krumke:
Almost disjoint paths and separating by forbidden pairs. Theor. Comput. Sci. 982: 114272 (2024) - [i16]Matthias Jung, Sven O. Krumke, Christof Schroth, Elisabeth Lobe, Wolfgang Mauerer:
QCEDA: Using Quantum Computers for EDA. CoRR abs/2403.12998 (2024) - 2022
- [j67]Oliver Bachtler, Sven O. Krumke:
Towards Obtaining a 3-Decomposition From a Perfect Matching. Electron. J. Comb. 29(4) (2022) - [j66]Sebastian S. Johann, Sven O. Krumke, Manuel Streicher:
Simultaneously dominating all spanning trees of a graph. Electron. J. Graph Theory Appl. 10(1): 67 (2022) - [j65]Neele Leithäuser, Dennis Adelhütte, Kristin Braun, Christina Büsing, Martin Comis, Timo Gersing, Sebastian S. Johann, Arie M. C. A. Koster, Sven O. Krumke, Frauke Liers, Eva Schmidt, Johanna Schneider, Manuel Streicher, Sebastian Tschuppik, Sophia Wrede:
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions. BMC Medical Informatics Decis. Mak. 22(1): 132 (2022) - [j64]Sven O. Krumke, Le Huy Minh:
2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem. Oper. Res. Lett. 50(6): 732-737 (2022) - [j63]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online algorithms to schedule a proportionate flexible flow shop of batching machines. J. Sched. 25(6): 643-657 (2022) - [c47]Oliver Bachtler, Tim Bergner, Sven O. Krumke:
Local Certification of Reachability. INOC 2022: 1-5 - [c46]Elisabeth Finhold, Till Heller, Sven O. Krumke, Neele Leithäuser:
A Bicriteria Almost Equal Minimum Cost Flow Model for Day-Ahead Trading. OR 2022: 181-187 - [i15]Niklas Gräf, Till Heller, Sven O. Krumke:
On Reward-Penalty-Selection Games. CoRR abs/2201.05515 (2022) - 2021
- [j62]Heiner Ackermann, Erik Diessel, Sven O. Krumke:
Robust flows with adaptive mitigation. EURO J. Comput. Optim. 9: 100002 (2021) - [i14]Rebekka Haese, Till Heller, Sven O. Krumke:
Algorithms and Complexity for the Almost Equal Maximum Flow Problem. CoRR abs/2104.05288 (2021) - [i13]Niklas Gräf, Till Heller, Sven O. Krumke:
On the Connection between Individual Scaled Vickrey Payments and the Egalitarian Allocation. CoRR abs/2106.14442 (2021) - [i12]Till Heller, Sven O. Krumke, Karl-Heinz Küfer:
The Reward-Penalty-Selection Problem. CoRR abs/2106.14601 (2021) - [i11]Till Heller, Sven Oliver Krumke:
Computing the egalitarian allocation with network flows. CoRR abs/2106.15389 (2021) - 2020
- [j61]Sven O. Krumke, Le Huy Minh:
Robust absolute single machine makespan scheduling-location problem on trees. Oper. Res. Lett. 48(1): 29-32 (2020) - [j60]Oliver Bachtler, Sven O. Krumke, Le Huy Minh:
Robust single machine makespan scheduling with release date uncertainty. Oper. Res. Lett. 48(6): 816-819 (2020) - [j59]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Scheduling a proportionate flow shop of batching machines. J. Sched. 23(5): 575-593 (2020) - [c45]Marco V. Natale, Matthias Jung, Kira Kraft, Frederik Lauer, Johannes Feldmann, Chirag Sudarshan, Christian Weis, Sven Oliver Krumke, Norbert Wehn:
Efficient Generation of Application Specific Memory Controllers. MEMSYS 2020: 233-247 - [i10]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines. CoRR abs/2005.03552 (2020) - [i9]Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke:
Scheduling a Proportionate Flow Shop of Batching Machines. CoRR abs/2006.09872 (2020) - [i8]Luca E. Schäfer, Stefan Ruzika, Sven O. Krumke, Carlos M. Fonseca:
On the Bicriterion Maximum Flow Network Interdiction Problem. CoRR abs/2010.02730 (2020)
2010 – 2019
- 2019
- [j58]Sven O. Krumke, Eva Schmidt, Manuel Streicher:
Robust multicovers with budgeted uncertainty. Eur. J. Oper. Res. 274(3): 845-857 (2019) - [j57]Sven O. Krumke, Clemens Thielen, Philipp Weinschenk, Stephan Westphal:
Full implementation of social choice functions in dominant strategies. Int. J. Game Theory 48(1): 337-361 (2019) - [c44]Luca E. Schäfer, Tobias Dietz, Marco V. Natale, Stefan Ruzika, Sven O. Krumke, Carlos M. Fonseca:
The Bicriterion Maximum Flow Network Interdiction Problem in s-t-Planar Graphs. OR 2019: 133-139 - [c43]Rebekka Haese, Till Heller, Sven O. Krumke:
Algorithms and Complexity for the Almost Equal Maximum Flow Problem. OR 2019: 323-329 - 2018
- [j56]Michael Holzhauser, Sven O. Krumke:
A generalized approximation framework for fractional network flow and packing problems. Math. Methods Oper. Res. 87(1): 19-50 (2018) - [j55]Nir Halman, Michael Holzhauser, Sven O. Krumke:
An FPTAS for the knapsack problem with parametric weights. Oper. Res. Lett. 46(5): 487-491 (2018) - [c42]David Brück, Sven Oliver Krumke:
Validating Measurement Data in Manufacturing Processes. OR 2018: 415-420 - [i7]Sebastian S. Johann, Sven O. Krumke, Manuel Streicher:
Simultaneous Dominating Set for Spanning Tree Factorings. CoRR abs/1810.12887 (2018) - 2017
- [j54]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
A network simplex method for the budget-constrained minimum cost flow problem. Eur. J. Oper. Res. 259(3): 864-872 (2017) - [j53]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
On the complexity and approximability of budget-constrained minimum cost flows. Inf. Process. Lett. 126: 24-29 (2017) - [j52]Michael Holzhauser, Sven O. Krumke:
An FPTAS for the parametric knapsack problem. Inf. Process. Lett. 126: 43-47 (2017) - [j51]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
Maximum flows in generalized processing networks. J. Comb. Optim. 33(4): 1226-1256 (2017) - [i6]Michael Holzhauser, Sven O. Krumke:
An FPTAS for the parametric knapsack problem. CoRR abs/1701.07822 (2017) - [i5]Michael Holzhauser, Sven Oliver Krumke:
An FPTAS for the Knapsack Problem with Parametric Weights. CoRR abs/1703.06048 (2017) - 2016
- [j50]Michael Holzhauser, Sven Oliver Krumke, Clemens Thielen:
Budget-constrained minimum cost flows. J. Comb. Optim. 31(4): 1720-1745 (2016) - [j49]Sabine Büttner, Sven O. Krumke:
The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation. J. Comb. Optim. 32(3): 842-854 (2016) - [j48]André B. Chassein, Sven O. Krumke, Clemens Thielen:
Capacitated network design games with weighted players. Networks 68(2): 141-158 (2016) - [c41]Matthias Jung, Deepak M. Mathew, Christian Weis, Norbert Wehn, Irene Heinrich, Marco V. Natale, Sven O. Krumke:
ConGen: An Application Specific DRAM Memory Controller Generator. MEMSYS 2016: 257-267 - [i4]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows. CoRR abs/1607.02282 (2016) - [i3]Michael Holzhauser, Sven O. Krumke, Clemens Thielen:
A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem. CoRR abs/1607.02284 (2016) - [i2]Michael Holzhauser, Sven O. Krumke:
A Generalized Approximation Framework for Fractional Network Flow and Packing Problems. CoRR abs/1612.05474 (2016) - 2015
- [j47]Michael Holzhauser, Sven Oliver Krumke, Clemens Thielen:
Convex generalized flows. Discret. Appl. Math. 190-191: 86-99 (2015) - [j46]Pascal Halffmann, Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
On the Online Min-Wait Relocation Problem. Electron. Notes Discret. Math. 50: 281-286 (2015) - [j45]Thomas L. Werth, Sabine Büttner, Sven Oliver Krumke:
Robust bottleneck routing games. Networks 66(1): 57-66 (2015) - [i1]Sahar Bsaybes, Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem. CoRR abs/1511.02751 (2015) - 2014
- [j44]Thomas L. Werth, Heike Sperber, Sven Oliver Krumke:
Computation of equilibria and the price of anarchy in bottleneck congestion games. Central Eur. J. Oper. Res. 22(4): 687-712 (2014) - [c40]Sven Oliver Krumke, Florian D. Schwahn, Clemens Thielen:
Being Negative Makes Life NP-hard (for Product Sellers). FUN 2014: 277-288 - [c39]Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
Relocation in Carsharing Systems Using Flows in Time-Expanded Networks. SEA 2014: 87-98 - 2013
- [j43]Sven Oliver Krumke, Christiane Zeck:
Generalized max flow in series-parallel graphs. Discret. Optim. 10(2): 155-162 (2013) - [j42]Sven O. Krumke, Alain Quilliot, Annegret Katrin Wagler, Jan-Thierry Wegener:
Models and Algorithms for Carsharing Systems and Related Problems. Electron. Notes Discret. Math. 44: 201-206 (2013) - [j41]Sven Oliver Krumke, Clemens Thielen:
The generalized assignment problem with minimum quantities. Eur. J. Oper. Res. 228(1): 46-55 (2013) - [j40]Marco Bender, Sabine Büttner, Sven O. Krumke:
Online delay management on a single train line: beyond competitive analysis. Public Transp. 5(3): 243-266 (2013) - [c38]Sven O. Krumke, Rob van Stee, Stephan Westphal:
Online Job Admission. Fundamental Problems in Computing 2013: 435-454 - 2012
- [j39]Sven Oliver Krumke, Clemens Thielen:
Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537]. Inf. Process. Lett. 112(13): 523-524 (2012) - [c37]Neele Leithäuser, Ingmar Schüle, Sven O. Krumke:
Optimierte Abstimmung der Umsteigebeziehungenim ungetakteten ÖPNV unter Berücksichtigung der Umlaufplanung. MKWI 2012: 263-274 - [c36]Neele Leithäuser, Sven Oliver Krumke, Maximilian Merkert:
Approximating Infeasible 2VPI-Systems. WG 2012: 225-236 - 2011
- [j38]Sven Oliver Krumke, Alfred Taudes, Stephan Westphal:
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines. Comput. Oper. Res. 38(8): 1103-1108 (2011) - [j37]Sven Oliver Krumke, Clemens Thielen, Stephan Westphal:
Interval scheduling on related machines. Comput. Oper. Res. 38(12): 1836-1844 (2011) - [j36]Sven Oliver Krumke, Clemens Thielen:
Minimum cost flows with minimum quantities. Inf. Process. Lett. 111(11): 533-537 (2011) - [j35]Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber:
Selfish bin coloring. J. Comb. Optim. 22(4): 531-548 (2011) - [j34]Sven Oliver Krumke, Clemens Thielen, Christiane Zeck:
Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization. Math. Methods Oper. Res. 74(1): 53-75 (2011) - [j33]Clemens Thielen, Sven Oliver Krumke:
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. Theory Comput. Syst. 49(1): 196-223 (2011) - [c35]Janick V. Frasch, Sven Oliver Krumke, Stephan Westphal:
MIP Formulations for Flowshop Scheduling with Limited Buffers. TAPAS 2011: 127-138 - 2010
- [j32]Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Sleman Saliba:
clever or smart: Strategies for the online target date assignment problem. Discret. Appl. Math. 158(1): 71-79 (2010)
2000 – 2009
- 2009
- [b2]Sven Oliver Krumke, Hartmut Noltemeier:
Graphentheoretische Konzepte und Algorithmen, 2. Auflage. Leitfäden der Informatik, Teubner 2009, ISBN 978-3-8348-0629-1, pp. I-X, 1-408 - [j31]Irene Fink, Sven Oliver Krumke, Stephan Westphal:
New lower bounds for online k-server routing problems. Inf. Process. Lett. 109(11): 563-567 (2009) - [j30]Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger:
How hard is it to find extreme Nash equilibria in network congestion games? Theor. Comput. Sci. 410(47-49): 4989-4999 (2009) - [c34]Birgit Engels, Sven Oliver Krumke, Rainer Schrader, Christiane Zeck:
Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2. CTW 2009: 239-243 - [c33]Clemens Thielen, Sven Oliver Krumke:
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. SAGT 2009: 36-47 - [c32]Clemens Thielen, Sven Oliver Krumke:
Complexity of Strong Implementability. ACAC 2009: 1-12 - 2008
- [j29]Stephan Westphal, Sven Oliver Krumke:
Pruning in column generation for service vehicle dispatching. Ann. Oper. Res. 159(1): 355-371 (2008) - [j28]Sven Oliver Krumke, Dirk Räbiger, Rainer Schrader:
Semi-preemptive routing on trees. Discret. Appl. Math. 156(17): 3298-3304 (2008) - [j27]Sven Oliver Krumke, Sleman Saliba, Tjark Vredeveld, Stephan Westphal:
Approximation algorithms for a vehicle routing problem. Math. Methods Oper. Res. 68(2): 333-359 (2008) - [j26]Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal:
A monotone approximation algorithm for scheduling with precedence constraints. Oper. Res. Lett. 36(2): 247-249 (2008) - [j25]Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie:
Bincoloring. Theor. Comput. Sci. 407(1-3): 231-241 (2008) - [c31]Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke, Katharina Gerhardt, Stephan Westphal, Peter Merz:
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. EvoCOP 2008: 158-169 - [c30]Clemens Thielen, Sven Oliver Krumke:
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints. WAOA 2008: 105-118 - [c29]Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Heike Sperber, Gerhard J. Woeginger:
How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games? WINE 2008: 82-93 - 2007
- [j24]Sven Oliver Krumke, Elena O. Gavriliouk:
Referee report on the book titled "Production planning by mixed integer programming". Math. Methods Oper. Res. 66(3): 559-562 (2007) - [c28]Sven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp:
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. OPODIS 2007: 159-173 - 2006
- [j23]Benjamin Hiller, Sven Oliver Krumke, Jörg Rambau:
Reoptimization gaps versus model errors in online-dispatching of service units for ADAC. Discret. Appl. Math. 154(13): 1897-1907 (2006) - [j22]Sleman Saliba, Sven Oliver Krumke, Stephan Westphal:
Online-Optimization of Large-Scale Vehicle Dispatching Problems. Electron. Notes Discret. Math. 25: 145-146 (2006) - [j21]Stephan Westphal, Sven Oliver Krumke, Rob van Stee:
Competitive Algorithms for Cottage Rental. Electron. Notes Discret. Math. 25: 187-188 (2006) - [j20]Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
A heuristic for the Stacker Crane Problem on trees which is almost surely exact. J. Algorithms 61(1): 1-19 (2006) - [j19]Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie:
Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294]. Theor. Comput. Sci. 352(1-3): 347-348 (2006) - [j18]Sandra Gutiérrez, Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
How to whack moles. Theor. Comput. Sci. 361(2-3): 329-341 (2006) - 2005
- [j17]Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
A Hard Dial-a-Ride Problem that is Easy on Average. J. Sched. 8(3): 197-210 (2005) - [c27]Elisabeth Gassner, Sven Oliver Krumke:
Deterministic Online Optical Call Admission Revisited. WAOA 2005: 190-202 - [c26]Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld:
The Online Target Date Assignment Problem. WAOA 2005: 230-243 - [c25]Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Maarten Lipmann, Alberto Marchetti-Spaccamela, Leen Stougie:
On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem. WAOA 2005: 258-269 - 2004
- [j16]Benjamin Hiller, Sven Oliver Krumke, Jörg Rambau:
Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC. Electron. Notes Discret. Math. 18: 157-163 (2004) - [j15]Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe:
Budget constrained minimum cost connected medians. J. Discrete Algorithms 2(4): 453-469 (2004) - 2003
- [j14]Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie:
News from the online traveling repairman. Theor. Comput. Sci. 295: 279-294 (2003) - [c24]Sven Oliver Krumke, Rui Liu, Errol L. Lloyd, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi:
Topology Control Problems under Symmetric and Asymmetric Power Thresholds. ADHOC-NOW 2003: 187-198 - [c23]Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff:
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. ISAAC 2003: 605-614 - [c22]Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld:
How to Whack Moles. WAOA 2003: 192-205 - 2002
- [c21]Sven Oliver Krumke, Luigi Laura, Maarten Lipmann, Alberto Marchetti-Spaccamela, Willem de Paepe, Diana Poensgen, Leen Stougie:
Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. APPROX 2002: 200-214 - [c20]Sven Oliver Krumke, Jörg Rambau, Luis Miguel Torres:
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows. ESA 2002: 637-648 - [c19]Martin Grötschel, Sven Oliver Krumke, Jörg Rambau, Luis Miguel Torres:
Online-Dispatching of Automobile Service Units. OR 2002: 168-173 - [c18]Sven Oliver Krumke, Maarten Lipmann, Willem de Paepe, Diana Poensgen, Jörg Rambau, Leen Stougie, Gerhard J. Woeginger:
How to cut a cake almost fairly. SODA 2002: 263-264 - [c17]Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth:
Budgeted Maximum Graph Coverage. WG 2002: 321-332 - [c16]Sven Oliver Krumke, Diana Poensgen:
Online Call Admission in Optical Networks with Larger Demands. WG 2002: 333-344 - 2001
- [j13]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth:
Upgrading bottleneck constrained forests. Discret. Appl. Math. 108(1-2): 129-142 (2001) - [j12]Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth:
Euler is standing in line dial-a-ride problems with precedence-constraints. Discret. Appl. Math. 113(1): 87-107 (2001) - [j11]Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie:
The Online TSP Against Fair Adversaries. INFORMS J. Comput. 13(2): 138-148 (2001) - [j10]Sven Oliver Krumke, Madhav V. Marathe, S. S. Ravi:
Models and Approximation Algorithms for Channel Assignment in Radio Networks. Wirel. Networks 7(6): 575-584 (2001) - [c15]Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie:
Online Bin Coloring. ESA 2001: 74-85 - [c14]Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie:
News from the Online Traveling Repairman. MFCS 2001: 487-499 - [c13]Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth:
Multiple Hotlink Assignment. WG 2001: 189-200 - 2000
- [c12]Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau:
The Online Dial-a-Ride Problem under Reasonable Load. CIAC 2000: 125-136 - [c11]Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie:
The Online-TSP against Fair Adversaries. CIAC 2000: 137-149 - [c10]Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau:
Online Dial-a-Ride Problems: Minimizing the Completion Time. STACS 2000: 639-650 - [c9]Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe:
Budget Constrained Minimum Cost Connected Medians. WG 2000: 267-278
1990 – 1999
- 1999
- [j9]Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke:
Network Design and Improvement. ACM Comput. Surv. 31(3es): 2 (1999) - [j8]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Minimum Cost Spanning Trees by Upgrading Nodes. J. Algorithms 33(1): 92-111 (1999) - [j7]Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes. Theor. Comput. Sci. 221(1-2): 139-155 (1999) - [c8]Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth:
Euler is Standing in Line. WG 1999: 42-54 - 1998
- [j6]Sven Oliver Krumke, Hans-Christoph Wirth:
On the Minimum Label Spanning Tree Problem. Inf. Process. Lett. 66(2): 81-85 (1998) - [j5]S. Schwarz, Sven Oliver Krumke:
On Budget-Constrained Flow Improvement. Inf. Process. Lett. 66(6): 291-297 (1998) - [j4]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi:
Approximation Algorithms for Certain Network Improvement Problems. J. Comb. Optim. 2(3): 257-288 (1998) - [j3]Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi:
Modifying Edges of a Network to Obtain Short Subgraphs. Theor. Comput. Sci. 203(1): 91-121 (1998) - [c7]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth:
Upgrading Bottleneck Constrained Forests. WG 1998: 215-226 - 1997
- [b1]Sven O. Krumke:
On the approximability of location and network design problems. Julius Maximilian University of Würzburg, Shaker 1997, ISBN 3-8265-2718-6, pp. 1-203 - [j2]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz:
Compact Location Problems. Theor. Comput. Sci. 181(2): 379-404 (1997) - [c6]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi:
Network improvement problems. Network Design: Connectivity and Facilities Location 1997: 247-268 - [c5]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes. ICALP 1997: 281-291 - 1996
- [c4]Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister:
Modifying Networks to Obtain Low Cost Trees. WG 1996: 293-307 - 1995
- [j1]Sven Oliver Krumke:
On a Generalization of the p-Center Problem. Inf. Process. Lett. 56(2): 67-71 (1995) - [c3]Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe:
Compact Location Problems with Budget and Communication Constraints. COCOON 1995: 510-519 - [c2]Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe:
Complexity and Approximability of Certain Bicriteria Location Problems. WG 1995: 73-87 - 1993
- [c1]Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Compact Location Problems. FSTTCS 1993: 238-247
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
