1.7k citations
- Technion – Israel Institute of TechnologyIL151 papers
- Oranim Academic College of EducationIL134 papers
- Tel Aviv UniversityIL55 papers
- Heidelberg UniversityDE36 papers
- Carmel (Israel)IL29 papers
- Columbia UniversityUS25 papers
- Massachusetts Institute of TechnologyUS25 papers
- National Research University Higher School of EconomicsRU25 papers
- University of AmsterdamNL22 papers
- Hebrew University of JerusalemIL21 papers
- Princeton UniversityUS21 papers
- Centre National de la Recherche ScientifiqueFR20 papers
Showing 2006 · cs.DSShow all
3 papers · 2 filters
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.DS2006★ 6 cited
Finding heaviest H-subgraphs in real weighted graphs, with applications
Virginia Vassilevska, Ryan Williams, Raphael Yuster
For a graph G with real weights assigned to the vertices (edges), the MAX H-SUBGRAPH problem is to find an H-subgraph of G with maximum total weight, if one exists. The all-pairs M…
cs.DS2006★ 3 cited
Fixed-Parameter Complexity of Minimum Profile Problems
Gregory Gutin, Stefan Szeider, Anders Yeo
Let be a graph. An ordering of is a bijection $α: V\dom \{1,2,..., |V|\}.$ For a vertex in , its closed neighborhood is T…