A new view on rural postman based on Eulerian extension and matching (Q1932348): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q175575
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2012.04.007 / rank
Normal rank
 
Property / author
 
Property / author: Rolf Niedermeier / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2012.04.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012760542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristic algorithms for the windy rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spanning subgraphs of eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the hierarchical Chinese postman problem as a rural postman problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of even/odd subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the Rural Postman problem on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Eulerian Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Eulerian Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / 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: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Connected Even/Odd Subgraph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Some Postman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the undirected rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Eulerian exposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fundamental problem in vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems: Comments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal / 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 / DOI
 
Property / DOI: 10.1016/J.JDA.2012.04.007 / rank
 
Normal rank

Latest revision as of 13:36, 16 December 2024

scientific article
Language Label Description Also known as
English
A new view on rural postman based on Eulerian extension and matching
scientific article

    Statements

    A new view on rural postman based on Eulerian extension and matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2013
    0 references
    arc routing
    0 references
    arc addition
    0 references
    Chinese postman
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references