Work

Tight lower bounds for the online labeling problem

Year: 2012

Type: conference-paper

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/2213977.2214083

Authors: Jan Bulánek, Michal Koucký, Michael Saks

Institutions: Charles University, Czech Academy of Sciences, Institute of Mathematics, Rutgers, The State University of New Jersey

Language: English

Topic: Optimization and Search Problems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2031770154

FWCI: 2.155

Cites: 20

Cited by: 18

Related to: 10