Digital Library
Close
Browse articles from a journal
Search for
Magazine
Article
ISSN
NBN article
NBN magazine
DARE/NARCIS document
with title:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
9 results found
no
title
author
magazine
year
volume
issue
page(s)
type
1
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Shapira, Asaf
2009
59
4
p. 621-633
article
2
An Approximation Algorithm for Binary Searching in Trees
Laber, Eduardo
2009
59
4
p. 601-620
article
3
A Unified Approach to Approximating Partial Covering Problems
Könemann, Jochen
2009
59
4
p. 489-509
article
4
Competitive Algorithms for Due Date Scheduling
Bansal, Nikhil
2009
59
4
p. 569-582
article
5
Constant-Degree Graph Expansions that Preserve Treewidth
Markov, Igor L.
2009
59
4
p. 461-470
article
6
New Approximation Algorithms for Minimum Cycle Bases of Graphs
Kavitha, Telikepalli
2009
59
4
p. 471-488
article
7
On Bounded Leg Shortest Paths Problems
Roditty, Liam
2009
59
4
p. 583-600
article
8
Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l∞-Fitting Robinson Structures to Distances
Chepoi, Victor
2009
59
4
p. 521-568
article
9
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem
Xiao, Mingyu
2009
59
4
p. 510-520
article
9 results found
Koninklijke Bibliotheek -
National Library of the Netherlands