On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129085544, #quickstatements; #temporary_batch_1723945101418
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.10.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2897485334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a model for backtracking and dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized priority algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized greedy matching. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Max-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Online Stochastic Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy matching: guarantees and limitations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to: ``Greedy matching: guarantees and limitations'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the k-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority algorithms for graph optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Incremental) priority algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conceptually simple algorithms for variants of online bipartite matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Submodular Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bound on Johnson's algorithm for maximum satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models of greedy algorithms for graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online computation with advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified tight analysis of Johnson's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph problems in a semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Matching: Beating 1-1/e / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Matching: New Algorithms with Better Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with unknown distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with random arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Matching: Online Actions Based on Offline Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Streams: Algorithms and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Greedy Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler 3/4-Approximation Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Bin Packing / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129085544 / rank
 
Normal rank

Latest revision as of 03:42, 18 August 2024

scientific article
Language Label Description Also known as
English
On extensions of the deterministic online model for bipartite matching and max-sat
scientific article

    Statements

    On extensions of the deterministic online model for bipartite matching and max-sat (English)
    0 references
    0 references
    2 May 2019
    0 references
    0 references
    online algorithms
    0 references
    priority algorithms
    0 references
    advice
    0 references
    parallel online algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references