Suchergebnisse - "Constant-factor approximation algorithms"

A constant-factor approximation for weighted bond cover von Kim, Eun Jung, Lee, Euiwoong, Thilikos, Dimitrios M.

“… The WeightedF-Vertex Deletion for a class F of graphs asks, weighted graph G, for a minimum weight vertex set S such that G−S∈F. The case when F is …”
Volltext

Scenario reduction revisited: fundamental limits and guarantees von Rujeerapaiboon, Napat, Schindler, Kilian, Kuhn, Daniel, Wiesemann, Wolfram

“… The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish …”
Volltext

Approximability of guarding weak visibility polygons von Bhattacharya, Pritam, Ghosh, Subir Kumar, Roy, Bodhayan

“… The art gallery problem enquires about the least number of guards that are sufficient to ensure that an art gallery, represented by a polygon P, is fully …”
Volltext

Polynomial-Time Approximability of the Asymmetric Problem of Covering a Graph by a Bounded Number of Cycles von Khachai, M. Yu, Neznakhina, E. D., Ryzhenko, K. V.

“… Recently, O. Svensson and V. Traub have provided the first proof of the polynomial-time approximability of the asymmetric traveling salesman problem (ATSP) in …”
Volltext

Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem von Khachay, M. Yu, Neznakhina, E. D., Ryzhenko, K. V.

“… For the first time, algorithms with constant performance guarantees are substantiated for a series of asymmetric routing problems of combinatorial …”
Volltext

Augmenting Outerplanar Graphs to Meet Diameter Requirements von Ishii, Toshimasa

“… Given an undirected graph G=(V,E) and an integer D≥1, we consider the problem of augmenting G by a minimum set of new edges so that the diameter becomes at …”
Volltext

On the Value of Information in Dynamic Multiple‐Vehicle Routing Problems von Arsie, Alessandro, Enright, John J., Frazzoli, Emilio

“… This chapter contains sections titled: Introduction Problem formulation Control policy description Performance analysis in light load A performance analysis …”
Volltext