Work

On extensions of the deterministic online model for bipartite matching and max-sat

Year: 2018

Type: article

Source: Theoretical Computer Science

DOI: 10.1016/j.tcs.2018.10.015

Authors: N. Pena, A. Borodin

Institution: University of Toronto

Language: English

Topic: Optimization and Search Problems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: Natural Sciences and Engineering Research Council of Canada

Award: Design, analysis and Theory of Algorithms

OpenAlex ID: W2897485334

FWCI: 0.467

Cites: 91

Cited by: 3

Related to: 10