你好! Tracked shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Comput
Type
Physical Book
Publisher
Author
Year
2014
Language
English
Pages
444
Format
Paperback
Dimensions
23.40 x 15.60 x 2.20 cm
ISBN13
9783662207291

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Comput

Klaus Jansen;Sanjeev Khanna;José D. P. Rolim (Author) · Springer · Paperback

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Comput - Klaus Jansen;Sanjeev Khanna;José D. P. Rolim

Cheaper New Book Imported to Taiwan
Delivery: 02 Sep - 15 Sep Shipping: 12 to 16 business days.
NT$ 2,050
Faster New Book Imported to Taiwan
Delivery: 21 Aug - 01 Sep Shipping: 5 to 6 business days.
NT$ 2,148
NT$ 2,050

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Comput"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews