We give faster and simpler approximation algorithms for the (1, 2)-TSP problem, a well-
studied variant of the traveling salesperson problem where all distances between cities are …

In this paper, we consider the NP-hard problem of determining fixed-length cycles in
undirected edge-weighted graphs. Two solution methods are proposed, one based on …

The Capacitated Vehicle Routing Problem (CVRP) is one of the most extensively studied
problems in combinatorial optimization. According to the property of the demand of …

Given an undirected complete graph G=(V, E) on kn vertices with a non-negative weight
function on E, the maximum-weight k-cycle (k-path) packing problem aims to compute a set …

We initiate the theoretical study of Ext-TSP, a problem that originates in the area of profile-
guided binary optimization. Given a graph $ G=(V, E) $ with positive edge weights $ w …

The k-path partition problem (kPP), defined on a graph G=(V, E), is a well-known NP-hard
problem when k≥ 3. The goal of the kPP is to find a minimum collection of vertex-disjoint …

Given an edge-weighted (metric/general) complete graph with n vertices, where n mod k= 0,
the maximum weight (metric/general) k-cycle/path partition problem is to find a set of nk …

The detection of fake news has received increasing attention over the past few years, but
there are more subtle ways of deceiving one's audience. In addition to the content of news …

Задача коммивояжера на максимум имеет ряд практических приложений, например,
при сжатии произвольных данных и анализе последовательностей ДНК. При том, что …

Given an edge-weighted (metric/general) complete graph with n vertices, the maximum
weight (metric/general) k-cycle/path packing problem is to find a set of vertex-disjoint k …