Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 59
Volume 59, Number 1, April 2006
- Esther M. Arkin, Refael Hassin, Asaf Levin
:
Approximations for minimum and min-max vehicle routing problems. 1-18 - Edith Cohen, Martin J. Strauss:
Maintaining time-decaying stream aggregates. 19-36 - Monaldo Mastrolilli:
A linear time approximation scheme for the single machine scheduling problem with controllable processing times. 37-52 - Nicholas J. A. Harvey, Richard E. Ladner, László Lovász, Tami Tamir:
Semi-matchings for bipartite graphs and load balancing. 53-78
Volume 59, Number 2, May 2006
- Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
On generalized gossiping and broadcasting. 81-106 - Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku:
Efficient algorithms for a constrained k-tree core problem in a tree network. 107-124 - Zhi-Zhong Chen, Tatsuie Tsukiji:
Computing bounded-degree phylogenetic roots of disconnected graphs. 125-148 - Bruce E. Sagan, Jaejin Lee:
An algorithmic sign-reversing involution for special rim-hook tableaux. 149-161
a service of 
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.
last updated on 2024-04-22 20:02 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:
