Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	August 2004
Genre:	EDV / Informatik
	Algorithm Analysis and Problem Complexity / Algorithmen und Datenstrukturen / Algorithms / Algorithms & data structures / C / computer science / Computer Science, general / Computer science—Mathematics / Computers / Discrete Mathematics / Discrete Mathematics in Computer Science / Diskrete Mathematik / Mathematical theory of computation / Mathematik für Informatiker / Maths for computer scientists / Numeric Computing / Numerical analysis / Numerische Mathematik / randomization / randomized algorithms / Theory of Computation mehr...
ISBN:	9783540228943
EAN-Code:	9783540228943
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	#3122 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	1370 gr
Seiten:	434
Illustration:	X, 434 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Contributed Talks of APPROX.- Designing Networks with Existing Traffic to Support Fast Restoration.- Simultaneous Source Location.- Computationally-Feasible Truthful Auctions for Convex Bundles.- Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks.- On the Crossing Spanning Tree Problem.- A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One.- Maximum Coverage Problem with Group Budget Constraints and Applications.- The Greedy Algorithm for the Minimum Common String Partition Problem.- Approximating Additive Distortion of Embeddings into Line Metrics.- Polylogarithmic Inapproximability of the Radio Broadcast Problem.- On Systems of Linear Equations with Two Variables per Equation.- An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case.- Cost-Sharing Mechanisms for Network Design.- Approximating Max k CSP Using Random Restrictions.- Approximation Schemes for Broadcasting in Heterogenous Networks.- Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks.- Convergence Issues in Competitive Games.- Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem.- Min-Max Multiway Cut.- Contributed Talks of RANDOM.- The Chromatic Number of Random Regular Graphs.- Estimating the Distance to a Monotone Function.- Edge Coloring with Delays.- Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption.- The Sketching Complexity of Pattern Matching.- Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions.- Robust Locally Testable Codes and Products of Codes.- A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes.-Strong Refutation Heuristics for Random k-SAT.- Counting Connected Graphs and Hypergraphs via the Probabilistic Method.- Improved Randomness Extraction from Two Independent Sources.- The Diameter of Randomly Perturbed Digraphs and Some Applications.- Maximum Weight Independent Sets and Matchings in Sparse Random Graphs.- Estimating Frequency Moments of Data Streams Using Random Linear Combinations.- Fooling Parity Tests with Parity Gates.- Distribution-Free Connectivity Testing.- Testing the Independence Number of Hypergraphs.- A Note on Approximate Counting for k-DNF.