Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Elsevier

9780444876997

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Algebraic Methods for Trie Statistics

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73107-4 ◽

1985 ◽

pp. 145-188 ◽

Cited By ~ 6

Author(s):

Philippe Flajolet ◽

Mireille Regnier ◽

Dominique Sotteau

Keyword(s):

Algebraic Methods

Download Full-text

Compact Channel Routing of Multiterminal Nets

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73111-6 ◽

1985 ◽

pp. 255-279 ◽

Cited By ~ 6

Author(s):

M. Sarrafzadeh ◽

F.P. Preparata

Keyword(s):

Channel Routing

Download Full-text

Network Design with Multiple Demand: A New Approach

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73109-8 ◽

1985 ◽

pp. 211-237 ◽

Cited By ~ 3

Author(s):

M. Lucertini ◽

G. Paletta

Keyword(s):

Network Design ◽

New Approach

Download Full-text

A Threshold for Multiple Edge Coverings in Random Hypergraphs

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73114-1 ◽

1985 ◽

pp. 311-319

Author(s):

C. Vercellis

Keyword(s):

Multiple Edge ◽

Random Hypergraphs

Download Full-text

A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73101-3 ◽

1985 ◽

pp. 27-45 ◽

Cited By ~ 40

Author(s):

R. Bar-Yehuda ◽

S. Even

Keyword(s):

Vertex Cover ◽

Vertex Cover Problem ◽

Local Ratio ◽

Weighted Vertex ◽

Cover Problem

Download Full-text

Dynamic Programming Parallel Procedures for SIMD Architectures

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73102-5 ◽

1985 ◽

pp. 47-63

Author(s):

Paola Bertolazzi

Keyword(s):

Dynamic Programming

Download Full-text

Easy Solutions for the K–Center Problem or the Dominating Set Problem on Random Graphs

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73108-6 ◽

1985 ◽

pp. 189-209 ◽

Cited By ~ 2

Author(s):

Dorit S. Hochbaum

Keyword(s):

Random Graphs ◽

Dominating Set ◽

Center Problem ◽

Dominating Set Problem

Download Full-text

On Some Relationships Between Combinatorics and Probabilistic Analysis

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73113-x ◽

1985 ◽

pp. 291-309

Author(s):

M. Talamo ◽

A. Marchetti–Spaccamela ◽

M. Protasi

Keyword(s):

Probabilistic Analysis

Download Full-text

Simulations Among Classes of Random Access Machines and Equivalence Among Numbers Succinctly Represented11A preliminary version of the first part of this paper has been published in the Proceedings of the ACM Symp. on theory of Computation, Milwaukee, 1991.

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73103-7 ◽

1985 ◽

pp. 65-89 ◽

Cited By ~ 2

Author(s):

A. Bertoni ◽

G. Mauri ◽

N. Sabadini

Keyword(s):

Random Access ◽

Theory Of Computation ◽

Preliminary Version

Download Full-text

Copyright page

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies ◽

10.1016/s0304-0208(08)73098-6 ◽

1985 ◽

pp. iv

Download Full-text

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics StudiesLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Elsevier

Algebraic Methods for Trie Statistics

Compact Channel Routing of Multiterminal Nets

Network Design with Multiple Demand: A New Approach

A Threshold for Multiple Edge Coverings in Random Hypergraphs

A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem

Dynamic Programming Parallel Procedures for SIMD Architectures

Easy Solutions for the K–Center Problem or the Dominating Set Problem on Random Graphs

On Some Relationships Between Combinatorics and Probabilistic Analysis

Simulations Among Classes of Random Access Machines and Equivalence Among Numbers Succinctly Represented11A preliminary version of the first part of this paper has been published in the Proceedings of the ACM Symp. on theory of Computation, Milwaukee, 1991.

Copyright page

Analysis and Design of Algorithms for Combinatorial Problems - North-Holland Mathematics Studies
Latest Publications