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
no 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 27 matches
- 2000
- Alexander A. Ageev, Refael Hassin, Maxim Sviridenko:
An approximation algorithm for MAX DICUT with given sizes of parts. APPROX 2000: 34-41 - Sanjeev Arora:
Approximation algorithms that take advice. APPROX 2000: 1 - Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Randomized path coloring on binary trees. APPROX 2000: 60-71 - Baruch Awerbuch, Yossi Azar, Oded Regev:
Maximizing job benefits on-line. APPROX 2000: 42-50 - Piotr Berman, Junichiro Fukuyama:
Variable length sequencing with two lengths. APPROX 2000: 51-59 - Alberto Caprara, Giuseppe F. Italiano, Gurusamy Mohan, Alessandro Panconesi, Aravind Srinivasan:
Wavelength rerouting in optical networks, or the Venetian routing problem. APPROX 2000: 72-83 - Moses Charikar:
Greedy approximation algorithms for finding dense components in a graph. APPROX 2000: 84-95 - Bhaskar DasGupta, Michael A. Palis:
Online real-time preemptive scheduling of jobs with deadlines. APPROX 2000: 96-107 - Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
On the relative complexity of approximate counting problems. APPROX 2000: 108-119 - Uriel Feige, Michael Langberg, Kobbi Nissim:
On the hardness of approximating N P witnesses. APPROX 2000: 120-131 - Sándor P. Fekete, Henk Meijer:
Maximum dispersion and geometric maximum weight cliques. APPROX 2000: 132-143 - Rudolf Fleischer, Steven S. Seiden:
New results for online page replication. APPROX 2000: 144-154 - Venkatesan Guruswami:
Inapproximability results for set splitting and satisfiability problems with no mixed clauses. APPROX 2000: 155-166 - Refael Hassin, R. Ravi, F. Sibel Salman:
Approximation algorithms for a capacitated network design problem. APPROX 2000: 167-176 - Dorit S. Hochbaum:
Instant recognition of polynominal time solvability, half integrality and 2-approximations. APPROX 2000: 2-14 - Kamal Jain, Vijay V. Vazirani:
An approximation algorithm for the fault tolerant metric facility location problem. APPROX 2000: 177-183 - Jochen Könemann, Goran Konjevod, Ojas Parekh, Amitabh Sinha:
Improved approximations for tour and tree covers. APPROX 2000: 184-193 - Guy Kortsarz, Zeev Nutov:
Approximating node connectivity problems via set covers. APPROX 2000: 194-205 - Krzysztof Lorys, Katarzyna E. Paluch:
Rectangle tiling. APPROX 2000: 206-213 - Rolf H. Möhring:
Scheduling under uncertainty: Optimizing against a randomizing adversary. APPROX 2000: 15-26 - Tobias Polzin, Siavash Vahdati Daneshmand:
Primal-dual approaches to the Steiner problem. APPROX 2000: 214-225 - Christian Schindelhauer:
On the inapproximability of broadcasting time. APPROX 2000: 226-237 - Hadas Shachnai, Tami Tamir:
Polynominal time approximation schemes for class-constrained packing problem. APPROX 2000: 238-249 - David B. Shmoys:
Approximation algorithms for facility location problems. APPROX 2000: 27-33 - Rob van Stee, Johannes A. La Poutré:
Partial servicing of on-line jobs. APPROX 2000: 250-261 - Santosh S. Vempala, Adrian Vetta:
Factor 4/3 approximations for minimum 2-connected subgraphs. APPROX 2000: 262-273 - Klaus Jansen, Samir Khuller:
Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1913, Springer 2000, ISBN 3-540-67996-0 [contents]
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-09-29 05:31 CEST 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