UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

On the minimum routing cost clustered tree problem

Journal of combinatorial optimization, 2017-04, Vol.33 (3), p.1106-1121

2017

Volltextzugriff (PDF)

A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs

Computational Geometry, Graphs and Applications, p.188-194

Volltextzugriff (PDF)

Parameterized algorithms for min–max 2-cluster editing

Journal of combinatorial optimization, 2017-07, Vol.34 (1), p.47-63

2017

Volltextzugriff (PDF)

An improved parameterized algorithm for the p-cluster vertex deletion problem

Journal of combinatorial optimization, 2017-02, Vol.33 (2), p.373-388

2017

Volltextzugriff (PDF)

An optimal algorithm for the maximum-density path in a tree

Information processing letters, 2009-08, Vol.109 (17), p.975-979

Wu, Bang Ye

2009

Volltextzugriff (PDF)

Finding Friend Groups in Blogosphere

22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008), 2008, p.1046-1050

2008

Volltextzugriff (PDF)

A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem

Algorithmica, 2013-02, Vol.65 (2), p.467-479

Wu, Bang Ye

2013

Volltextzugriff (PDF)

Tree-based object tracking without mobility statistics in wireless sensor networks

Wireless networks, 2010-07, Vol.16 (5), p.1263-1276

2010

Volltextzugriff (PDF)

An improved algorithm for the k-source maximum eccentricity spanning trees

Discrete Applied Mathematics, 2004-09, Vol.143 (1), p.342-350

Ye Wu, Bang

2004

Volltextzugriff (PDF)

Constructing the maximum consensus tree from rooted triples

Journal of combinatorial optimization, 2004-03, Vol.8 (1), p.29-39

Wu, Bang Ye

2004

Volltextzugriff (PDF)

On approximating metric 1-median in sublinear time

Information processing letters, 2014-04, Vol.114 (4), p.163-166

Wu, Bang Ye

2014

Volltextzugriff (PDF)

A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion

Computing and Combinatorics, p.469-480

Volltextzugriff (PDF)

A polynomial time approximation scheme for the two-source minimum routing cost spanning trees

Journal of algorithms, 2002-08, Vol.44 (2), p.359-378

Ye Wu, Bang

2002

Volltextzugriff (PDF)

On the intercluster distance of a tree metric

Theoretical computer science, 2006-12, Vol.369 (1), p.136-141

Wu, Bang Ye

2006

Volltextzugriff (PDF)

On the maximum disjoint paths problem on edge-colored graphs

Discrete optimization, 2012-02, Vol.9 (1), p.50-57

Wu, Bang Ye

2012

Volltextzugriff (PDF)

A note on approximating the min–max vertex disjoint paths on directed acyclic graphs

Journal of computer and system sciences, 2011-11, Vol.77 (6), p.1054-1057

Wu, Bang Ye

2011

Volltextzugriff (PDF)

Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs

Journal of combinatorial optimization, 2013-10, Vol.26 (3), p.592-607

Wu, Bang Ye

2013

Volltextzugriff (PDF)

The Swap Edges of a Multiple-Sources Routing Tree

Algorithmica, 2008-02, Vol.50 (3), p.299-311

2008

Volltextzugriff (PDF)

On the clustered Steiner tree problem

Journal of combinatorial optimization, 2015-08, Vol.30 (2), p.370-386

2015

Volltextzugriff (PDF)

A tight bound on the min-ratio edge-partitioning problem of a tree

Discrete Applied Mathematics, 2010-07, Vol.158 (14), p.1471-1478

2010

Volltextzugriff (PDF)

The backup 2-center and backup 2-median problems on trees

Networks, 2009-01, Vol.53 (1), p.39-49

2009

Volltextzugriff (PDF)

An analysis of the LPT algorithm for the max–min and the min–ratio partition problems

Theoretical computer science, 2005-12, Vol.349 (3), p.407-419

Wu, Bang Ye

2005

Volltextzugriff (PDF)

An efficient algorithm for minimal edit cost of graph degree anonymity

2018 IEEE International Conference on Applied System Invention (ICASI), 2018, p.574-577

2018

Volltextzugriff (PDF)

Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions

Algorithmica, 2015-07, Vol.72 (3), p.818-835

2015

Volltextzugriff (PDF)

Social network sampling with keeping community structure

2018 IEEE International Conference on Applied System Invention (ICASI), 2018, p.228-230

2018

Volltextzugriff (PDF)

1 – 25 von 221

Menü

Weitere Dienste

Einstellungen

On the minimum routing cost clustered tree problem

A 7/6-Approximation Algorithm for the Max-Min Connected Bipartition Problem on Grid Graphs

Parameterized algorithms for min–max 2-cluster editing

An improved parameterized algorithm for the p-cluster vertex deletion problem

An optimal algorithm for the maximum-density path in a tree

Finding Friend Groups in Blogosphere

A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem

Tree-based object tracking without mobility statistics in wireless sensor networks

An improved algorithm for the k-source maximum eccentricity spanning trees

Constructing the maximum consensus tree from rooted triples

On approximating metric 1-median in sublinear time

A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion

A polynomial time approximation scheme for the two-source minimum routing cost spanning trees

On the intercluster distance of a tree metric

On the maximum disjoint paths problem on edge-colored graphs

A note on approximating the min–max vertex disjoint paths on directed acyclic graphs

Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs

The Swap Edges of a Multiple-Sources Routing Tree

On the clustered Steiner tree problem

A tight bound on the min-ratio edge-partitioning problem of a tree

The backup 2-center and backup 2-median problems on trees

An analysis of the LPT algorithm for the max–min and the min–ratio partition problems

An efficient algorithm for minimal edit cost of graph degree anonymity

Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions

Social network sampling with keeping community structure

Suchergebnisse filtern