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

Discrete Newton's Algorithm for Parametric Submodular Function Minimization

Integer Programming and Combinatorial Optimization, 2017, Vol.10328, p.212-227

2017

Volltextzugriff (PDF)

Matroids and integrality gaps for hypergraphic steiner tree relaxations

Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012, p.1161-1176

2012

Volltextzugriff (PDF)

Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data

Algorithms – ESA 2006, 2006, p.268-279

2006

Volltextzugriff (PDF)

Tight approximation algorithms for maximum general assignment problems

Symposium on Discrete Algorithms: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm; 22-26 Jan. 2006, 2006, p.611-620

2006

Volltextzugriff (PDF)

Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques: 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18–20, 2001 Proceedings

2001

Volltextzugriff (PDF)

Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling

Automata, Languages and Programming, 2003, Vol.2719, p.1138-1152

2003

Volltextzugriff (PDF)

Universal bounds on buffer size for packetizing fluid policies in input queued, crossbar switches

IEEE INFOCOM 2004, 2004, Vol.2, p.1126-1134 vol.2

2004

Volltextzugriff (PDF)

Low Power Oriented CMOS Circuit Optimization Protocol

Design, Automation and Test in Europe, 2005, p.640-645

2005

Volltextzugriff (PDF)

An algorithmic framework for wireless information flow

2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2009, p.294-300

2009

Volltextzugriff (PDF)

Community detection in hypergraphs, spiked tensor models, and Sum-of-Squares

2017 International Conference on Sampling Theory and Applications (SampTA), 2017, p.124-128

2017

Volltextzugriff (PDF)

Metric Definition for Circuit Speed Optimization

Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation, 2003, p.451-460

2003

Volltextzugriff (PDF)

Deterministic network information flows using polylinking systems

2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo), 2010, p.1-1

2010

Volltextzugriff (PDF)

Performance Metric Based Optimization Protocol

Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation, 2004, p.100-109

2004

Volltextzugriff (PDF)

Approximating the stochastic knapsack problem: the benefit of adaptivity

45th Annual IEEE Symposium on Foundations of Computer Science, 2004, p.208-217

2004

Volltextzugriff (PDF)

Minimum Bounded Degree Spanning Trees

2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006, p.273-282

Goemans, M.X.

2006

Volltextzugriff (PDF)

A supermodular relaxation for scheduling with release dates

Integer Programming and Combinatorial Optimization, 2005, p.288-300

2005

Volltextzugriff (PDF)

Recycled polycarbonate as impact modifier in polypropylene

AIP Conference Proceedings, 2019, Vol.2055 (1)

2019

Volltextzugriff (PDF)

Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming

Annual ACM Symposium on Theory of Computing: Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001, p.443-452

2001

Volltextzugriff (PDF)

Approximating the smallest k-edge connected spanning subgraph by LP-rounding

Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, 2005, p.562-571

2005

Volltextzugriff (PDF)

An approximate König's theorem for edge-coloring weighted bipartite graphs

Annual ACM Symposium on Theory of Computing: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing; 13-16 June 2004, 2004, p.398-406

2004

Volltextzugriff (PDF)