Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShlomi Rubinstein
Person information
- affiliation: Tel Aviv University, Israel
- unicode name: שלומי רובינשטיין
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2000
[b1]Shlomi Rubinstein:
Approximation algorithms for special cases of the maximum quadratic assignment problem. Tel Aviv University, Israel, 2000
Journal Articles
- 2009
- [j15]Refael Hassin, Asaf Levin
, Shlomi Rubinstein:
Approximation algorithms for maximum latency and partial cycle cover. Discret. Optim. 6(2): 197-205 (2009) - 2006
- [j14]Refael Hassin, Shlomi Rubinstein:
An approximation algorithm for maximum triangle packing. Discret. Appl. Math. 154(6): 971-979 (2006) - [j13]Refael Hassin, Shlomi Rubinstein:
Erratum to "An approximation algorithm for maximum triangle packing": [Discrete Applied Mathematics 154 (2006) 971-979]. Discret. Appl. Math. 154(18): 2620 (2006) - [j12]Refael Hassin, Shlomi Rubinstein:
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes. Inf. Process. Lett. 98(3): 92-95 (2006) - 2005
- [j11]Refael Hassin, Shlomi Rubinstein:
On the complexity of the k-customer vehicle routing problem. Oper. Res. Lett. 33(1): 71-76 (2005) - 2004
- [j10]Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems. Algorithmica 39(2): 175-187 (2004) - 2003
- [j9]Refael Hassin, Shlomi Rubinstein:
Approximation algorithms for the metric maximum clustering problem with given cluster sizes. Oper. Res. Lett. 31(3): 179-184 (2003) - 2002
- [j8]Refael Hassin, Shlomi Rubinstein:
A 7/8-approximation algorithm for metric Max TSP. Inf. Process. Lett. 81(5): 247-251 (2002) - [j7]Refael Hassin, Shlomi Rubinstein:
Robust Matchings. SIAM J. Discret. Math. 15(4): 530-537 (2002) - 2001
- [j6]Refael Hassin, Shlomi Rubinstein:
Approximation algorithms for maximum linear arrangement. Inf. Process. Lett. 80(4): 171-177 (2001) - 2000
- [j5]Refael Hassin, Shlomi Rubinstein:
Better approximations for max TSP. Inf. Process. Lett. 75(4): 181-186 (2000) - 1998
- [j4]Refael Hassin, Shlomi Rubinstein:
An Approximation Algorithm for the Maximum Traveling Salesman Problem. Inf. Process. Lett. 67(3): 125-130 (1998) - 1997
- [j3]Refael Hassin, Shlomi Rubinstein:
An Approximation Algorithm for Maximum Packing of 3-Edge Paths. Inf. Process. Lett. 63(2): 63-67 (1997) - [j2]Refael Hassin, Shlomi Rubinstein, Arie Tamir:
Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3): 133-137 (1997) - 1994
- [j1]Refael Hassin, Shlomi Rubinstein:
Approximations for the Maximum Acyclic Subgraph Problem. Inf. Process. Lett. 51(3): 133-140 (1994)
Conference and Workshop Papers
- 2004
- [c5]Refael Hassin, Shlomi Rubinstein:
An Approximation Algorithm for Maximum Triangle Packing. ESA 2004: 403-413 - 2002
- [c4]Esther M. Arkin, Refael Hassin, Shlomi Rubinstein, Maxim Sviridenko:
Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems. SWAT 2002: 280-287 - 2001
- [c3]Refael Hassin, Shlomi Rubinstein:
A 7/8-Approximation Algorithm for Metric Max TSP. WADS 2001: 205-209 - 2000
- [c2]Refael Hassin, Shlomi Rubinstein:
Approximation Algorithms for Maximum Linear Arrangement. SWAT 2000: 231-236 - [c1]Refael Hassin, Shlomi Rubinstein:
Robust Matchings and Maximum Clustering. SWAT 2000: 251-258
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
