On the advice complexity of online matching on the line

HIGHLIGHTS

• Who: . . . . et al. from the University of Szeged, Szeged, Hungary have published the research: On the Advice Complexity of Online Matching on the Line, in the Journal: (JOURNAL)

SUMMARY

ISSN 1365-8050 Béla Csaba, Judit Nagy-György 2 The advice complexity of 1-competitive online algorithms The authors give matching upper and lower bounds for the advice complexity of 1-competitive online algorithms. Let us begin with two folklore results on the structure of any optimal matching on the line. Consider an optimal matching corresponding to permutation π (i.e. ri is . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or Email

Password

Remember me

Lost your password?

If you don't have an account, you can create one here.