Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 5 of 963 results
Sort by: relevance publication year

Improving TSP Tours Using Dynamic Programming over Tree Decompositions

JOURNAL ARTICLE published 31 October 2019 in ACM Transactions on Algorithms

Research funded by Narodowe Centrum Nauki (2013/09/B/ST6/03136) | European Research Council (677651)

Authors: Marek Cygan | Łukasz Kowalik | Arkadiusz Socała

Towards Optimal Moment Estimation in Streaming and Distributed Models

JOURNAL ARTICLE published 31 July 2023 in ACM Transactions on Algorithms

Authors: Rajesh Jayaram | David P. Woodruff

Smaller Cuts, Higher Lower Bounds

JOURNAL ARTICLE published 31 October 2021 in ACM Transactions on Algorithms

Research funded by European Union’s Horizon 2020 research and innovation programme (755839) | Israel Science Foundation (1696/14) | Austrian Science Fund (FWF) and netIDEE SCIENCE (33775-N)

Authors: Amir Abboud | Keren Censor-Hillel | Seri Khoury | Ami Paz

Testing Euclidean minimum spanning trees in the plane

JOURNAL ARTICLE published June 2008 in ACM Transactions on Algorithms

Research funded by Deutsche Forschungsgemeinschaft (Me872/8-3) | University of Warwick (EP/DO63191/1) | National Science Foundation (ITR-CCR-0313219CCR-0105701) | Engineering and Physical Sciences Research Council (EP/DO63191/1)

Authors: Artur Czumaj | Christian Sohler

Linear time 3-approximation for the MAST problem

JOURNAL ARTICLE published March 2009 in ACM Transactions on Algorithms

Authors: Vincent Berry | Christophe Paul | Sylvain Guillemot | François Nicolas

On approximating multicriteria TSP

JOURNAL ARTICLE published April 2012 in ACM Transactions on Algorithms

Authors: Bodo Manthey

Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ

JOURNAL ARTICLE published October 2006 in ACM Transactions on Algorithms

Authors: William Evans | David Kirkpatrick

Individual displacements for linear probing hashing with different insertion policies

JOURNAL ARTICLE published October 2005 in ACM Transactions on Algorithms

Authors: Svante Janson

Problems column

JOURNAL ARTICLE published January 2006 in ACM Transactions on Algorithms

Authors: Samir Khuller

Analysis of linear combination algorithms in cryptography

JOURNAL ARTICLE published July 2005 in ACM Transactions on Algorithms

Authors: Peter J. Grabner | Clemens Heuberger | Helmut Prodinger | Jörg M. Thuswaldner

The register function for t -ary trees

JOURNAL ARTICLE published July 2006 in ACM Transactions on Algorithms

Authors: Michael Drmota | Helmut Prodinger

Computing rank-convolutions with a mask

JOURNAL ARTICLE published December 2009 in ACM Transactions on Algorithms

Authors: László Babai | Pedro F. Felzenszwalb

Time-dependent multi-scheduling of multicast

JOURNAL ARTICLE published December 2009 in ACM Transactions on Algorithms

Authors: Rami Cohen | Dror Rawitz | Danny Raz

Approximating corridors and tours via restriction and relaxation techniques

JOURNAL ARTICLE published June 2010 in ACM Transactions on Algorithms

Authors: Arturo Gonzalez-Gutierrez | Teofilo F. Gonzalez

Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree

JOURNAL ARTICLE published September 2011 in ACM Transactions on Algorithms

Research funded by Deutsche Forschungsgemeinschaft (GRK 1408)

Authors: Paul Bonsma | Frederic Dorn

Editorial note

JOURNAL ARTICLE published August 2010 in ACM Transactions on Algorithms

Authors: Susanne Alber

On the bichromatic k -set problem

JOURNAL ARTICLE published August 2010 in ACM Transactions on Algorithms

Authors: Timothy M. Chan

Determining plurality

JOURNAL ARTICLE published June 2008 in ACM Transactions on Algorithms

Authors: Laurent Alonso | Edward M. Reingold

Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights

JOURNAL ARTICLE published 31 July 2017 in ACM Transactions on Algorithms

Research funded by NSF (1464239, 1218620 and 1540547)

Authors: Michael Dinitz | Guy Kortsarz | Zeev Nutov

Optimizing throughput and energy in online deadline scheduling

JOURNAL ARTICLE published December 2009 in ACM Transactions on Algorithms

Research funded by University of Hong Kong (7176104) | Engineering and Physical Sciences Research Council (EP/E028276/1)

Authors: Ho-Leung Chan | Joseph Wun-Tat Chan | Tak-Wah Lam | Lap-Kei Lee | Kin-Sum Mak | Prudence W. H. Wong