default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 48 matches
- 2024
- Lars Rohwedder, Ashkan Safari, Tjark Vredeveld:
A k-swap Local Search for Makespan Scheduling. CoRR abs/2401.05956 (2024) - 2021
- Moritz Buchem, Tjark Vredeveld:
Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines. Comput. Oper. Res. 125: 105093 (2021) - Tim Ophelders, Roel Lambers, Frits C. R. Spieksma, Tjark Vredeveld:
A note on equitable Hamiltonian cycles. Discret. Appl. Math. 303: 127-136 (2021) - José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld:
Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals. Math. Oper. Res. 46(4): 1452-1478 (2021) - Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese:
Additive Approximation Schemes for Load Balancing Problems. ICALP 2021: 42:1-42:17 - 2020
- Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese:
Additive Approximation Schemes for Load Balancing Problems. CoRR abs/2007.09333 (2020) - 2018
- José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld:
Recent developments in prophet inequalities. SIGecom Exch. 17(1): 61-70 (2018) - 2017
- José Correa, Patricio Foncea, Ruben Hoeksma, Tim Oosterwijk, Tjark Vredeveld:
Posted Price Mechanisms for a Random Stream of Customers. EC 2017: 169-186 - 2016
- Nikhil Bansal, Tim Oosterwijk, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. Algorithmica 76(4): 1077-1096 (2016) - Tobias Harks, Tim Oosterwijk, Tjark Vredeveld:
A logarithmic approximation for polymatroid congestion games. Oper. Res. Lett. 44(6): 712-717 (2016) - Verena Jung, Marianne Peeters, Tjark Vredeveld:
Drivers and Resistors for Supply Chain Collaboration. OR 2016: 623-628 - Tjark Vredeveld:
Vector Scheduling Problems. Encyclopedia of Algorithms 2016: 2323-2326 - 2015
- Veerle Timmermans, Tjark Vredeveld:
Scheduling with State-Dependent Machine Speed. WAOA 2015: 196-208 - 2014
- Nicole Megow, Tjark Vredeveld:
A Tight 2-Approximation for Preemptive Stochastic Scheduling. Math. Oper. Res. 39(4): 1297-1310 (2014) - Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed performance guarantees for local search. Math. Program. 146(1-2): 185-218 (2014) - Nikhil Bansal, Cyriel Rutten, Suzanne van der Ster, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Real-Time Scheduling on Identical Machines. LATIN 2014: 550-561 - Nikhil Bansal, Tjark Vredeveld, Ruben van der Zwaan:
Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds. LATIN 2014: 47-59 - 2012
- Benjamin Hiller, Tjark Vredeveld:
Probabilistic alternatives for competitive analysis. Comput. Sci. Res. Dev. 27(3): 189-196 (2012) - Tjark Vredeveld:
Stochastic online scheduling. Comput. Sci. Res. Dev. 27(3): 181-187 (2012) - Sebastián Marbán, Ruben van der Zwaan, Alexander Grigoriev, Benjamin Hiller, Tjark Vredeveld:
Dynamic pricing problems with elastic demand. Oper. Res. Lett. 40(3): 175-179 (2012) - Cyriel Rutten, Diego Recalde, Petra Schuurman, Tjark Vredeveld:
Performance guarantees of jump neighborhoods on restricted related parallel machines. Oper. Res. Lett. 40(4): 287-291 (2012) - 2011
- Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed Performance Guarantees for Local Search. ESA 2011: 772-783 - Sebastián Marbán, Cyriel Rutten, Tjark Vredeveld:
Learning in Stochastic Machine Scheduling. WAOA 2011: 21-34 - Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld:
Smoothed Performance Guarantees for Local Search. CoRR abs/1105.2686 (2011) - 2010
- Diego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld:
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling. LATIN 2010: 108-119 - 2008
- 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) - Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing with monotonicity constraint. Oper. Res. Lett. 36(5): 609-614 (2008) - Benjamin Hiller, Tjark Vredeveld:
Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison. ESA 2008: 528-539 - 2007
- Petra Schuurman, Tjark Vredeveld:
Performance Guarantees of Local Search for Multiprocessor Scheduling. INFORMS J. Comput. 19(1): 52-63 (2007) - Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing for homogeneous items. CTW 2007: 57-60
skipping 18 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-12-09 08:12 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint