Matches in SemOpenAlex for { <https://semopenalex.org/work/W2200532118> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W2200532118 abstract "We study the minimum backlog problem (MBP). This online problem arises, e.g., in the context of sensor networks. We focus on two main variants of MBP.The discrete MBP is a 2-person game played on a graph G = ( V , E ) . The player is initially located at a vertex of the graph. In each time step, the adversary pours a total of one unit of water into cups that are located on the vertices of the graph, arbitrarily distributing the water among the cups. The player then moves from her current vertex to an adjacent vertex and empties the cup at that vertex. The player's objective is to minimize the backlog, i.e., the maximum amount of water in any cup at any time.The geometric MBP is a continuous-time version of the MBP: the cups are points in the two-dimensional plane, the adversary pours water continuously at a constant rate, and the player moves in the plane with unit speed. Again, the player's objective is to minimize the backlog.We show that the competitive ratio of any algorithm for the MBP has a lower bound of ? ( D ) , where D is the diameter of the graph (for the discrete MBP) or the diameter of the point set (for the geometric MBP). Therefore we focus on determining a strategy for the player that guarantees a uniform upper bound on the absolute value of the backlog.For the absolute value of the backlog there is a trivial lower bound of ? ( D ) , and the deamortization analysis of Dietz and Sleator gives an upper bound of O ( D log ? N ) for N cups. Our main result is a tight upper bound for the geometric MBP: we show that there is a strategy for the player that guarantees a backlog of O ( D ) , independently of the number of cups.We also study a localized version of the discrete MBP: the adversary has a location within the graph and must act locally (filling cups) with respect to his position, just as the player acts locally (emptying cups) with respect to her position. We prove that deciding the value of this game is PSPACE-hard." @default.
- W2200532118 created "2016-06-24" @default.
- W2200532118 creator A5001506153 @default.
- W2200532118 creator A5015247956 @default.
- W2200532118 creator A5015542807 @default.
- W2200532118 creator A5019660321 @default.
- W2200532118 creator A5025555126 @default.
- W2200532118 creator A5049192389 @default.
- W2200532118 creator A5068761590 @default.
- W2200532118 date "2007-01-01" @default.
- W2200532118 modified "2023-09-27" @default.
- W2200532118 title "The minimum-backlog problem" @default.
- W2200532118 hasPublicationYear "2007" @default.
- W2200532118 type Work @default.
- W2200532118 sameAs 2200532118 @default.
- W2200532118 citedByCount "0" @default.
- W2200532118 crossrefType "journal-article" @default.
- W2200532118 hasAuthorship W2200532118A5001506153 @default.
- W2200532118 hasAuthorship W2200532118A5015247956 @default.
- W2200532118 hasAuthorship W2200532118A5015542807 @default.
- W2200532118 hasAuthorship W2200532118A5019660321 @default.
- W2200532118 hasAuthorship W2200532118A5025555126 @default.
- W2200532118 hasAuthorship W2200532118A5049192389 @default.
- W2200532118 hasAuthorship W2200532118A5068761590 @default.
- W2200532118 hasConcept C102408133 @default.
- W2200532118 hasConcept C114614502 @default.
- W2200532118 hasConcept C126255220 @default.
- W2200532118 hasConcept C132525143 @default.
- W2200532118 hasConcept C134306372 @default.
- W2200532118 hasConcept C151730666 @default.
- W2200532118 hasConcept C2779343474 @default.
- W2200532118 hasConcept C33923547 @default.
- W2200532118 hasConcept C41008148 @default.
- W2200532118 hasConcept C77553402 @default.
- W2200532118 hasConcept C80899671 @default.
- W2200532118 hasConcept C86803240 @default.
- W2200532118 hasConceptScore W2200532118C102408133 @default.
- W2200532118 hasConceptScore W2200532118C114614502 @default.
- W2200532118 hasConceptScore W2200532118C126255220 @default.
- W2200532118 hasConceptScore W2200532118C132525143 @default.
- W2200532118 hasConceptScore W2200532118C134306372 @default.
- W2200532118 hasConceptScore W2200532118C151730666 @default.
- W2200532118 hasConceptScore W2200532118C2779343474 @default.
- W2200532118 hasConceptScore W2200532118C33923547 @default.
- W2200532118 hasConceptScore W2200532118C41008148 @default.
- W2200532118 hasConceptScore W2200532118C77553402 @default.
- W2200532118 hasConceptScore W2200532118C80899671 @default.
- W2200532118 hasConceptScore W2200532118C86803240 @default.
- W2200532118 hasLocation W22005321181 @default.
- W2200532118 hasOpenAccess W2200532118 @default.
- W2200532118 hasPrimaryLocation W22005321181 @default.
- W2200532118 hasRelatedWork W1567388549 @default.
- W2200532118 hasRelatedWork W181389785 @default.
- W2200532118 hasRelatedWork W1935687795 @default.
- W2200532118 hasRelatedWork W2083596217 @default.
- W2200532118 hasRelatedWork W2104063661 @default.
- W2200532118 hasRelatedWork W2106371495 @default.
- W2200532118 hasRelatedWork W2140790988 @default.
- W2200532118 hasRelatedWork W2148732839 @default.
- W2200532118 hasRelatedWork W2240416680 @default.
- W2200532118 hasRelatedWork W2551778981 @default.
- W2200532118 hasRelatedWork W2949896327 @default.
- W2200532118 hasRelatedWork W2951641567 @default.
- W2200532118 hasRelatedWork W2951722786 @default.
- W2200532118 hasRelatedWork W2952340129 @default.
- W2200532118 hasRelatedWork W3099896668 @default.
- W2200532118 hasRelatedWork W3101753513 @default.
- W2200532118 hasRelatedWork W3106992400 @default.
- W2200532118 hasRelatedWork W3115498212 @default.
- W2200532118 hasRelatedWork W3170779178 @default.
- W2200532118 hasRelatedWork W330554831 @default.
- W2200532118 isParatext "false" @default.
- W2200532118 isRetracted "false" @default.
- W2200532118 magId "2200532118" @default.
- W2200532118 workType "article" @default.