Search Results - "Approximation algorithms and online algorithms"

  • Showing 1 - 6 results of 6
Refine Results
  1. 1
    Cover Image

    The Search-and-Mix Paradigm in Approximate Nash Equilibrium Algorithms by Deng, Xiaotie, Li, Dongchen, Hanyu Li

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 12.10.2023
    Published in arXiv.org (12.10.2023)
    “…AI in Math deals with mathematics in a constructive manner so that reasoning becomes automated, less laborious, and less error-prone. For algorithms, the…”
    Get full text
    Paper
    Save to List
    Saved in:
  2. 2
    Cover Image

    The mutual exclusion scheduling problem for permutation and comparability graphs by Jansen, Klaus

    ISSN: 0890-5401, 1090-2651
    Published: San Diego, CA Elsevier Inc 2003
    Published in Information and computation (2003)
    “…In this paper, we consider the mutual exclusion scheduling problem for comparability graphs. Given an undirected graph G and a fixed constant m, the problem is…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    Mutual exclusion scheduling by Baker, Brenda S, Coffman, Edward G

    ISSN: 0304-3975, 1879-2294
    Published: Elsevier B.V 01.01.1996
    Published in Theoretical computer science (01.01.1996)
    “…Mutual exclusion scheduling is the problem of scheduling unit-time tasks non-preemptively on m processors subject to constraints represented by a graph G, such…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  4. 4
    Cover Image

    OPT Versus LOAD in Dynamic Storage Allocation by Buchsbaum, Adam L., Karloff, Howard, Kenyon, Claire, Reingold, Nick, Thorup, Mikkel

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2004
    Published in SIAM journal on computing (01.01.2004)
    “…Dynamic storage allocation is the problem of packing given axis-aligned rectangles into a horizontal strip of minimum height by sliding the rectangles…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  5. 5
    Cover Image

    Sum Multicoloring of Graphs by Bar-Noy, Amotz, Halldórsson, Magnús M., Kortsarz, Guy, Salman, Ravit, Shachnai, Hadas

    ISSN: 0196-6774, 1090-2678
    Published: San Diego, CA Elsevier Inc 01.11.2000
    Published in Journal of algorithms (01.11.2000)
    “…Scheduling dependent jobs on multiple machines is modeled by the graph multicoloring problem. In this paper we consider the problem of minimizing the average…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  6. 6
    Cover Image

    Polynomial time approximation schemes for general multiprocessor job shop scheduling by Jansen, Klaus, Porkolab, Lorant

    ISSN: 0196-6774, 1090-2678
    Published: San Diego, CA Elsevier Inc 01.11.2002
    Published in Journal of algorithms (01.11.2002)
    “…We study preemptive and non-preemptive versions of the general multiprocessor job shop scheduling problem: Given a set of n tasks each consisting of at most μ…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: