Makespan Trade-Offs for Visiting Triangle Edges
نویسندگان
چکیده
We study a primitive vehicle routing-type problem in which fleet of n unit speed robots start from point within non-obtuse triangle $$\Delta $$ , where $$n \in \{1,2,3\}$$ . The goal is to design robots’ trajectories so as visit all edges the with smallest visitation time makespan. begin our by introducing framework for subdividing into regions respect type optimal trajectory that each P admits, pertaining order are visited and how cost minimum makespan $$R_n(P)$$ determined, $$n\in These subdivisions starting points main result, trade-offs size fleet. In particular, we define $$\mathscr {R}_{n,m} (\Delta )= \max _{P \Delta } R_n(P)/R_m(P)$$ prove that, over triangles : (i) {R}_{1,3}(\Delta )$$ ranges $$\sqrt{10}$$ 4, (ii) {R}_{2,3}(\Delta $$\sqrt{2}$$ 2, (iii) {R}_{1,2}(\Delta 5/2 3. every case, pinpoint maximize well identify determine $$\inf _\Delta \mathscr {R}_{n,m}(\Delta $$\sup set triangles.
منابع مشابه
Trade-offs
23. Stent, G.S. (1972). Prematurity and uniqueness in scientific discovery. Sci. Am. 227, 84–93. 24. Mirsky, A.E., and Pollister, A.W. (1946). Chromosin, a desoyribose nucleoprotein complex of the cell nucleus. J. Gen. Physiol. 30, 117–148. 25. Boivin, A. (1947). Directed mutation in colon bacilli, by an inducing principle of desoxyribonucleic nature: Its meaning for the general biochemistry of...
متن کاملTrade-Offs for Add Gossiping
In the gossiping problem, each node of a network starts with a unique piece of information and must acquire the information of all the other nodes. This is done using two-way communications between pairs of nodes. In this paper, we consider gossiping in n-node networks with n odd, where we use a linear cost model, in which the cost of communication is proportional to the amount of information t...
متن کاملTrade-offs in Thailand.
P roteomics is defined as the protein complement of the genome and involves the complete analysis of all the proteins in a given sample [1,2]. Several technologies are involved, and numerous questions concerning the proteins are addressed. What proteins are contained in a biological sample? At what concentration do the proteins exist? How do protein expression levels alter in different samples?...
متن کاملA one-model approach for Computation of congestion With productions trade-offs and weight restrictions
متن کامل
Supercritical Space-Width Trade-Offs for Resolution
We show that there are CNF formulas which can be refuted in resolution in both small space and small width, but for which any small-width resolution proof must have space exceeding by far the linear worst-case upper bound. This significantly strengthens the space-width trade-offs in [BenSasson 2009], and provides one more example of trade-offs in the “supercritical” regime above worst case rece...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-79987-8_24