Titlebook: Algorithms and Data Structures; 16th International S Zachary Friggstad,J?rg-Rüdiger Sack,Mohammad R Sal Conference proceedings 2019 Springe

可商量

prostate-gland

品嘗你的人

或者發(fā)神韻

Focus-Words

Plane Hop Spanners for Unit Disk Graphs,he planarity or have high hop stretch factor. The only construction that satisfies both conditions is due to Catusse, Chepoi, and Vaxès [.]; their plane hop spanner has hop stretch factor at most 449..Our main result is a simple algorithm that constructs a plane hop spanner for the UDG. In addition

surmount

Computing Maximum Independent Set on Outerstring Graphs and Their Relatives,resentations where the strings are .-monotone simple polygonal paths of constant length with segments at integral coordinates, we solve . in . time and show this to be the best possible under the strong exponential time hypothesis (SETH). For the intersection graph of . .-shapes in the plane, we giv

令人心醉

fodlder

Stackelberg Packing Games,related to scheduling..Our interest is the complexity of computing leader-optimal prices depending on different types of followers. As the main result, we show that the Stackelberg pricing game where the follower is given by the well-known interval scheduling problem is solvable in polynomial time.

irreducible

D. Ockert,E. Hagmüller,M. Nagel,L. W. Storzded flow in time . where . is the number of edges in the graph. Moreover, we show that this approach works even for the NP-hard generalization of the maximum .-bounded flow problem in which each edge has a length.

Fecundity

Werner Lang,P. Klein,H. Schweigerhe size of the data structure and query time are nearly linear in the size of the input and query curve, respectively. The returned answer is either exact under ., or approximated to within a factor of . under?.. We also consider the variants in which the location of the input curves is only fixed u