On (1+ε)-approximate Data Reduction for the Rural Postman Problem

Conference

18th International conference on mathematical optimization theory and operations research
08-12 Jul 2019 , Екатеринбург

Journal

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Output data

Year: 2019, Volume: 11548, Pages: 279-294 Pages count : 16 DOI: 10.1007/978-3-030-22629-9_20

Tags

Eulerian extension; Lossy kernelization; Parameterized complexity

Authors

van Bevern René ¹ , Fluschnik Till ² , Tsidulko Oxana Yu. ^1,3

Affiliations

1	Novosibirsk State University
2	Technische Universität Berlin
3	Sobolev Institute of Mathematics

van Bevern R. , Fluschnik T. , Tsidulko O.Y.
On (1+ε)-approximate Data Reduction for the Rural Postman Problem
Lecture Notes in Computer Science. 2019. V.11548. P.279-294. DOI: 10.1007/978-3-030-22629-9_20 WOS Scopus OpenAlex