January 17, 2010 conference-paper Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls ACM-SIAM Symposium on Discrete Algorithms (SODA) DOI: 10.1137/1.9781611973075.36 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 11 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Improved Approximation Algorithms for the Expanding Search Problem 2026 SIAM Journal on Discrete Mathematics article Computer Science Complexity and Algorithms in Graphs 0 citations 1 result References 0