KOBV-Portal

Treffer pro Seite

Treffer 1 - 6 | 6 Treffer

Sortierung

Buch

Approximation, randomization, and combinatorial optimization : algorithms and techniques ; 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21 - 23, 2009 ; proceedings (2009)

Dinur, Irit ; APPROX 12 2009 Berkeley, Calif.

Berlin [u.a.] :Springer,

Dazugehörige Titel

zur Merkliste hinzufügen auf der Merkliste

Details

UID:

almahu_BV035681082

Umfang: XII, 740 S. ; , 235 mm x 155 mm.

ISBN: 978-3-642-03684-2

Serie: Lecture notes in computer science 5687

Sprache: Englisch

Schlagwort(e): Kombinatorische Optimierung ; Approximationsalgorithmus ; Approximationsalgorithmus ; Randomisierung ; Konferenzschrift ; Konferenzschrift

URL: Inhaltsverzeichnis

Bookmarklink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Buch

Fernleihwunsch

HU Berlin

TU Berlin

Online-Ressource

Approximation, randomization, and combinatorial optimization : algorithms and techniques ; 12th international workshop, APPROX 2009 and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21 - 23, 2009 ; proceedings (2009)

Dinur, Irit ; Jansen, Klaus ; Naor, Joseph ; [weitere]

Berlin [u.a.] : Springer

zur Merkliste hinzufügen auf der Merkliste

Details

UID:

gbv_60961410X

Umfang: Online-Ressource (XII, 740 S.)

Ausgabe: Online-Ausg. 2009 Springer eBook collection. Computer science Electronic reproduction; Available via World Wide Web

ISBN: 9783642036859

Serie: Lecture notes in computer science 5687

Anmerkung: Literaturangaben , Electronic reproduction; Available via World Wide Web

Weitere Ausg.: ISBN 3642036848

Weitere Ausg.: ISBN 9783642036842

Sprache: Englisch

Schlagwort(e): Kombinatorische Optimierung ; Approximationsalgorithmus ; Approximationsalgorithmus ; Randomisierung ; Konferenzschrift

DOI: 10.1007/978-3-642-03685-9

URL: Volltext

URL: Volltext (lizenzpflichtig)

URL: Inhaltstext

Bookmarklink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Online-Ressource

Online Zugang

Open Access Wunsch

UB Potsdam

Buch

Approximation, randomization, and combinatorial optimization : algorithms and techniques ; proceedings (2009)

Dinur, Irut ; APPROX

Berlin [u.a.] : Springer

zur Merkliste hinzufügen auf der Merkliste

Details

UID:

kobvindex_ZLB15066398

Umfang: XII, 740 Seiten , graph. Darst. , 24 cm

ISBN: 9783642036842

Serie: Lecture notes in computer science 5687

Anmerkung: Literaturangaben , Text engl.

Sprache: Englisch

Schlagwort(e): Kombinatorische Optimierung ; Approximationsalgorithmus ; Kongress ; Berkeley 〈Calif., 2009〉 ; Approximationsalgorithmus ; Randomisierung ; Kongress ; Berkeley 〈Calif., 2009〉 ; Kongress ; Konferenzschrift

URL: http://d-nb.info/995338590/04

Bookmarklink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Buch

Fernleihwunsch

Berlin VÖBB/ZLB

Online-Ressource

Dinur, Irut [Sonstige] ; APPROX 12 2009 Berkeley, Calif.

Berlin [u.a.] : Springer

zur Merkliste hinzufügen auf der Merkliste

Details

UID:

b3kat_BV035694816

Umfang: 1 Online-Ressource (XII, 740 S.)

ISBN: 9783642036859

Serie: Lecture Notes in Computer Science 5687

Weitere Ausg.: Erscheint auch als Druck-Ausgabe, Paperback ISBN 978-3-642-03684-2

Sprache: Englisch

Schlagwort(e): Approximationsalgorithmus ; Randomisierung ; Kombinatorische Optimierung ; Approximationsalgorithmus ; Konferenzschrift

DOI: 10.1007/978-3-642-03685-9

URL: Volltext

Bookmarklink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Online-Ressource

Online Zugang

Open Access Wunsch

BTU Cottbus

Online-Ressource

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings (2009)

Dinur, Irit. [editor.] ; Jansen, Klaus. [editor.] ; Naor, Joseph. [editor.] ; [weitere]

Berlin, Heidelberg :Springer Berlin Heidelberg :

Dazugehörige Titel

zur Merkliste hinzufügen auf der Merkliste

Details

UID:

almahu_9947364277702882

Umfang: XII, 742 p. 41 illus. , online resource.

ISBN: 9783642036859

Serie: Lecture Notes in Computer Science, 5687

Anmerkung: Contributed Talks of APPROX -- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs -- Adaptive Sampling for k-Means Clustering -- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs -- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs -- Truthful Mechanisms via Greedy Iterative Packing -- Resource Minimization Job Scheduling -- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders -- New Hardness Results for Diophantine Approximation -- PASS Approximation -- Optimal Sherali-Adams Gaps from Pairwise Independence -- An Approximation Scheme for Terrain Guarding -- Scheduling with Outliers -- Improved Inapproximability Results for Maximum k-Colorable Subgraph -- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems -- On the Optimality of Gluing over Scales -- On Hardness of Pricing Items for Single-Minded Bidders -- Real-Time Message Routing and Scheduling -- Approximating Some Network Design Problems with Node Costs -- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties -- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy -- Minimizing Average Shortest Path Distances via Shortcut Edge Addition -- Approximating Node-Connectivity Augmentation Problems -- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs -- On the Complexity of the Asymmetric VPN Problem -- Contributed Talks of RANDOM -- Deterministic Approximation Algorithms for the Nearest Codeword Problem -- Strong Parallel Repetition Theorem for Free Projection Games -- Random Low Degree Polynomials are Hard to Approximate -- Composition of Semi-LTCs by Two-Wise Tensor Products -- On the Security of Goldreich’s One-Way Function -- Random Tensors and Planted Cliques -- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry -- Average-Case Analyses of Vickrey Costs -- A Hypergraph Dictatorship Test with Perfect Completeness -- Extractors Using Hardness Amplification -- How Well Do Random Walks Parallelize? -- An Analysis of Random-Walk Cuckoo Hashing -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Succinct Representation of Codes with Applications to Testing -- Efficient Quantum Tensor Product Expanders and k-Designs -- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND -- Pseudorandom Generators and Typically-Correct Derandomization -- Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions -- Tolerant Linearity Testing and Locally Testable Codes -- Pseudorandom Bit Generators That Fool Modular Sums -- The Glauber Dynamics for Colourings of Bounded Degree Trees -- Testing ±1-weight halfspace -- Small-Bias Spaces for Group Products -- Small Clique Detection and Approximate Nash Equilibria -- Testing Computability by Width Two OBDDs -- Improved Polynomial Identity Testing for Read-Once Formulas -- Smooth Analysis of the Condition Number and the Least Singular Value.

In: Springer eBooks

Weitere Ausg.: Printed edition: ISBN 9783642036842

Sprache: Englisch

DOI: 10.1007/978-3-642-03685-9

URL: http://dx.doi.org/10.1007/978-3-642-03685-9

Bookmarklink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Online-Ressource

Open Access Wunsch

HU Berlin

Online-Ressource

Dinur, Irit. [editor.] ; Jansen, Klaus. [editor.] ; Naor, Seffi. [editor.] ; [weitere]

Berlin, Heidelberg :Springer Berlin Heidelberg :

zur Merkliste hinzufügen auf der Merkliste

Details

UID:

almahu_9949972665902882

Umfang: XII, 742 p. 41 illus. , online resource.

Ausgabe: 1st ed. 2009.

ISBN: 9783642036859

Serie: Theoretical Computer Science and General Issues, 5687

Anmerkung: Contributed Talks of APPROX -- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs -- Adaptive Sampling for k-Means Clustering -- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs -- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs -- Truthful Mechanisms via Greedy Iterative Packing -- Resource Minimization Job Scheduling -- The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders -- New Hardness Results for Diophantine Approximation -- PASS Approximation -- Optimal Sherali-Adams Gaps from Pairwise Independence -- An Approximation Scheme for Terrain Guarding -- Scheduling with Outliers -- Improved Inapproximability Results for Maximum k-Colorable Subgraph -- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems -- On the Optimality of Gluing over Scales -- On Hardness of Pricing Items for Single-Minded Bidders -- Real-Time Message Routing and Scheduling -- Approximating Some Network Design Problems with Node Costs -- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties -- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy -- Minimizing Average Shortest Path Distances via Shortcut Edge Addition -- Approximating Node-Connectivity Augmentation Problems -- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem -- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs -- On the Complexity of the Asymmetric VPN Problem -- Contributed Talks of RANDOM -- Deterministic Approximation Algorithms for the Nearest Codeword Problem -- Strong Parallel Repetition Theorem for Free Projection Games -- Random Low Degree Polynomials are Hard to Approximate -- Composition of Semi-LTCs by Two-Wise Tensor Products -- On the Security of Goldreich's One-Way Function -- Random Tensors and Planted Cliques -- Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry -- Average-Case Analyses of Vickrey Costs -- A Hypergraph Dictatorship Test with Perfect Completeness -- Extractors Using Hardness Amplification -- How Well Do Random Walks Parallelize? -- An Analysis of Random-Walk Cuckoo Hashing -- Hierarchy Theorems for Property Testing -- Algorithmic Aspects of Property Testing in the Dense Graphs Model -- Succinct Representation of Codes with Applications to Testing -- Efficient Quantum Tensor Product Expanders and k-Designs -- Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND -- Pseudorandom Generators and Typically-Correct Derandomization -- Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions -- Tolerant Linearity Testing and Locally Testable Codes -- Pseudorandom Bit Generators That Fool Modular Sums -- The Glauber Dynamics for Colourings of Bounded Degree Trees -- Testing ±1-weight halfspace -- Small-Bias Spaces for Group Products -- Small Clique Detection and Approximate Nash Equilibria -- Testing Computability by Width Two OBDDs -- Improved Polynomial Identity Testing for Read-Once Formulas -- Smooth Analysis of the Condition Number and the Least Singular Value.

In: Springer Nature eBook

Weitere Ausg.: Printed edition: ISBN 9783642036842

Weitere Ausg.: Printed edition: ISBN 9783642036866

Sprache: Englisch

DOI: 10.1007/978-3-642-03685-9

URL: https://doi.org/10.1007/978-3-642-03685-9

Bookmarklink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Online-Ressource

Open Access Wunsch

HU Berlin

Treffer 1 - 6 | 6 Treffer

Nichts oder nicht das Richtige gefunden? Für eine Suche/Fernleihbestellung aus dem Ausland nutzen Sie das Suche-Set "KOBV-International" im alten KOBV-Portal.

Meinten Sie 3462031848?

Meinten Sie 3492036848?

Meinten Sie 3642236898?

Kooperativer Bibliotheksverbund

Berlin Brandenburg