The Adwords Problem with Strict Capacity Constraints.
type: Item
instance of: scholarly article
zbMATH Open document ID: 1391.68125
author: Umang Bhaskar
author: Ajil Jalal
author: Rahul Vaze
publication date: 2018-04-19T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 91B26
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 6862058
zbMATH Keywords: online algorithms
zbMATH Keywords: adwords
zbMATH Keywords: budgeted matching
zbMATH Keywords: greedy algorithms
MaRDI profile type: Publication
full work available at URL: LIPIcs.FSTTCS.2016.30
OpenAlex ID: W2571778556
title: The Adwords Problem with Strict Capacity Constraints.
DOI: 10.4230/LIPICS.FSTTCS.2016.30
description: scientific article; zbMATH DE number 6862058