Randomized and Approximation Algorithms for Blue-Red Matching 1st Edition by Christos Nomikos, Aris Pagourtzis, Stathis Zachos ISBN 9783540744566

 Randomized and Approximation Algorithms for Blue-Red Matching 1st Edition by Christos Nomikos, Aris Pagourtzis, Stathis Zachos – Ebook PDF Instant Download/Delivery. 9783540744566
Full download Randomized and Approximation Algorithms for Blue-Red Matching 1st Edition after payment

Product details:

ISBN 10: 
ISBN 13: 9783540744566
Author: Christos Nomikos, Aris Pagourtzis, Stathis Zachos

We introduce the BLUE-RED MATCHING problem: given a graph with red and blue edges, and a bound w, find a maximum matching consisting of at most w edges of each color. We show that BLUE-RED MATCHING is at least as hard as the problem EXACT MATCHING (Papadimitriou and Yannakakis, 1982), for which it is still open whether it can be solved in polynomial time. We present an RNC algorithm for this problem as well as two fast approximation algorithms. We finally show the applicability of our results to the problem of routing and assigning wavelengths to a maximum number of requests in all-optical rings.

Randomized and Approximation Algorithms for Blue-Red Matching 1st  Table of contents:

1 Introduction
2 Problem Definition and Hardness
3 Approximation Algorithms for Blue-Red Matching
4 A Randomized Algorithm for Blue-Red Matching
5 Application to Optical Networking

People also search for Randomized and Approximation Algorithms for Blue-Red Matching 1st:

randomized and approximation algorithms
    
explain approximation and randomized algorithms
    
name the approximation and randomized algorithms
    
randomized algorithm with example
    
what is randomized algorithm