The Online House Numbering Problem: Min-Max Online List Labeling
نویسندگان
چکیده
We introduce and study the online house numbering problem, where houses are added arbitrarily along a road and must be assigned labels to maintain their ordering along the road. The online house numbering problem is related to classic online list labeling problems, except that the optimization goal here is to minimize the maximum number of times that any house is relabeled. We provide several algorithms that achieve interesting tradeoffs between upper bounds on the number of maximum relabels per element and the number of bits used by labels. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Trouble Spots in Online Direct-to-Consumer Prescription Drug Promotion: A Content Analysis of FDA Warning Letters
Background For the purpose of understanding the Food and Drug Administration’s (FDA’s) concerns regarding online promotion of prescription drugs advertised directly to consumers, this study examines notices of violations (NOVs) and warning letters issued by the FDA to pharmaceutical manufacturers. Methods The FDA’s warning letters and NOVs, which were issued to pharmaceutical companies over a...
متن کاملMarkov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm
The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...
متن کاملA CSA Method for Assigning Client to Servers in Online Social Networks
This paper deals with the problem of user-server assignment in online social network systems. Online social network applications such as Facebook, Twitter, or Instagram are built on an infrastructure of servers that enables them to communicate with each other. A key factor that determines the facility of communication between the users and the servers is the Expected Transmission Time (ETT). A ...
متن کاملCompanion to Off-line vs. On-line tuning: MAX–MIN Ant System for the TSP
In the paper [1] we compare the results achieved with off-line and on-line tuning approaches. In particular, we report the results of an experimental study based onMAX–MIN Ant System (MMAS) for the traveling salesman problem (TSP). In this framework, we analyze the impact on the performance of online tuning of the number of parameters adapted. Moreover, thanks to a social experiment carried out...
متن کاملA Solution to the Problem of Extrapolation in Car Following Modeling Using an online fuzzy Neural Network
Car following process is time-varying in essence, due to the involvement of human actions. This paper develops an adaptive technique for car following modeling in a traffic flow. The proposed technique includes an online fuzzy neural network (OFNN) which is able to adapt its rule-consequent parameters to the time-varying processes. The proposed OFNN is first trained by an growing binary tree le...
متن کامل