105 citations
- Oranim Academic College of EducationIL11 papers
- Carmel (Israel)IL4 papers
- Nankai UniversityCN4 papers
- Technion – Israel Institute of TechnologyIL4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Dalian Maritime UniversityCN3 papers
- Hebrew University of JerusalemIL3 papers
- Centrum Wiskunde & InformaticaNL2 papers
- Royal Holloway University of LondonGB2 papers
- University of IcelandIS2 papers
- University of Notre DameUS2 papers
- University UcinfCL2 papers
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2008
Single source shortest paths in -minor free graphs
Raphael Yuster
We present an algorithm for the Single Source Shortest Paths (SSSP) problem in \emph{-minor free} graphs. For every fixed , if is a graph with vertices having integer…
cs.DS2006
Improved results for a memory allocation problem
Leah Epstein, Rob van Stee
We consider a memory allocation problem that can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. A 3/2-appro…
cs.DS2004★ 2 cited
Online Searching with Turn Cost
Erik D. Demaine, Sandor P. Fekete, Shmuel Gal
We consider the problem of searching for an object on a line at an unknown distance OPT from the original position of the searcher, in the presence of a cost of d for each time the…