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...

Approximating minimum feedback sets and multicuts in directed graphs

Algorithmica, 1998-02, Vol.20 (2), p.151-174

1998

Volltextzugriff (PDF)

Flow in planar graphs with multiple sources and sinks

SIAM journal on computing, 1995-10, Vol.24 (5), p.1002-1017

1995

Volltextzugriff (PDF)

Dynamic storage allocation with known durations

Algorithms — ESA '97, 2005, p.378-387

2005

Volltextzugriff (PDF)

The Competitiveness of On-Line Assignments

Journal of algorithms, 1995, Vol.18 (2), p.221-237

1995

Volltextzugriff (PDF)

A unified approach to approximating resource allocation and scheduling

Journal of the ACM, 2001-09, Vol.48 (5), p.1069-1090

2001

Volltextzugriff (PDF)

The budgeted maximum coverage problem

Information processing letters, 1999-04, Vol.70 (1), p.39-45

1999

Volltextzugriff (PDF)

Resource optimization in QoS multicast routing of real-time multimedia

IEEE/ACM transactions on networking, 2004-04, Vol.12 (2), p.340-348

2004

Volltextzugriff (PDF)

Non-Cooperative Multicast and Facility Location Games

IEEE journal on selected areas in communications, 2007-08, Vol.25 (6), p.1193-1206

2007

Volltextzugriff (PDF)

Approximating the Throughput of Multiple Machines in Real-Time Scheduling

SIAM journal on computing, 2001, Vol.31 (2), p.331-352

2001

Volltextzugriff (PDF)

Divide-and-conquer approximation algorithms via spreading metrics

Journal of the ACM, 2000-07, Vol.47 (4), p.585-616

2000

Volltextzugriff (PDF)

Minimizing Service and Operation Costs of Periodic Scheduling

Mathematics of operations research, 2002-08, Vol.27 (3), p.518-544

2002

Volltextzugriff (PDF)

Approximating the Advertisement Placement Problem

Journal of scheduling, 2004-09, Vol.7 (5), p.365-374

2004

Volltextzugriff (PDF)

On the approximability of some network design problems

ACM transactions on algorithms, 2008-05, Vol.4 (2), p.1-17

2008

Volltextzugriff (PDF)

Pushing Dependent Data in Clients-Providers-Servers Systems

Wireless networks, 2003-09, Vol.9 (5), p.421-430

2003

Volltextzugriff (PDF)

The Steiner k-Cut Problem

SIAM journal on discrete mathematics, 2006-01, Vol.20 (1), p.261-271

2006

Volltextzugriff (PDF)

On-Line Load Balancing in a Hierarchical Server Topology

SIAM journal on computing, 2001, Vol.31 (2), p.527-549

2001

Volltextzugriff (PDF)

A 2-Approximation Algorithm for the Directed Multiway Cut Problem

SIAM journal on computing, 2001, Vol.31 (2), p.477-482

2001

Volltextzugriff (PDF)

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

SIAM journal on computing, 2000, Vol.30 (4), p.1231-1252

2000

Volltextzugriff (PDF)

Fast approximate graph partitioning algorithms

SIAM journal on computing, 1999, Vol.28 (6), p.2187-2214

1999

Volltextzugriff (PDF)

Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and bayesian inference

SIAM journal on computing, 1998-08, Vol.27 (4), p.942-959

1998

Volltextzugriff (PDF)

The probabilistic method yields deterministic parallel algorithms

Journal of computer and system sciences, 1994-12, Vol.49 (3), p.478-516

1994

Volltextzugriff (PDF)

Simple and fast algorithms for linear and integer programs with two variables per inequality

SIAM journal on computing, 1994-12, Vol.23 (6), p.1179-1192

1994

Volltextzugriff (PDF)

Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach

IEEE INFOCOM 2009, 2009, p.145-153

2009

Volltextzugriff (PDF)

Real-Time Scheduling with a Budget

Automata, Languages and Programming, 2003, p.1123-1137

2003

Volltextzugriff (PDF)

Admission Control in Networks with Advance Reservations

Algorithmica, 2004-12, Vol.40 (4), p.293-304

2004

Volltextzugriff (PDF)

1 – 25 von 64

Menü

Weitere Dienste

Einstellungen

Approximating minimum feedback sets and multicuts in directed graphs

Flow in planar graphs with multiple sources and sinks

Dynamic storage allocation with known durations

The Competitiveness of On-Line Assignments

A unified approach to approximating resource allocation and scheduling

The budgeted maximum coverage problem

Resource optimization in QoS multicast routing of real-time multimedia

Non-Cooperative Multicast and Facility Location Games

Approximating the Throughput of Multiple Machines in Real-Time Scheduling

Divide-and-conquer approximation algorithms via spreading metrics

Minimizing Service and Operation Costs of Periodic Scheduling

Approximating the Advertisement Placement Problem

On the approximability of some network design problems

Pushing Dependent Data in Clients-Providers-Servers Systems

The Steiner k-Cut Problem

On-Line Load Balancing in a Hierarchical Server Topology

A 2-Approximation Algorithm for the Directed Multiway Cut Problem

An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem

Fast approximate graph partitioning algorithms

Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and bayesian inference

The probabilistic method yields deterministic parallel algorithms

Simple and fast algorithms for linear and integer programs with two variables per inequality

Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach

Real-Time Scheduling with a Budget

Admission Control in Networks with Advance Reservations

Suchergebnisse filtern