On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Experiments on data reduction for optimal domination in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the mixed capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-factor approximations for capacitated arc routing without triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic tabu search algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the general routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch &amp; cut algorithm for the windy general routing problem and special cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Eulerian Extension and Rural Postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Kernels for Hitting Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Kernels for Connected Dominating Set on Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for weighted problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized approximation via fidelity preserving transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The laser-plotter beam routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of plotting and drilling machines: A case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rural postman parameterized by the number of components of required edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completeness theory for polynomial (Turing) kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the close-enough arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the general capacitated routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New inapproximability bounds for TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting connected vertex cover: FPT algorithms and lossy kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Kernels for Graph Contraction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fundamental problem in vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing finest mincut partitions of a graph and application to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Few Components to an Eulerian Graph by Adding Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new view on rural postman based on Eulerian extension and matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet size and mix problem for capacitated arc routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Revision as of 13:53, 19 August 2024

scientific article; zbMATH DE number 7769699
Language Label Description Also known as
English
On approximate data reduction for the Rural Postman Problem: Theory and experiments
scientific article; zbMATH DE number 7769699

    Statements

    On approximate data reduction for the Rural Postman Problem: Theory and experiments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2023
    0 references
    above-guarantee parameterization
    0 references
    capacitated arc routing
    0 references
    Eulerian extension
    0 references
    lossy kernelization
    0 references
    NP-hard problem
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers