Open access peer-reviewed chapter

Parallel Greedy Approximation on Large-Scale Combinatorial Auctions

By Naoki Fukuta and Takayuki Ito

Published: November 1st 2008

DOI: 10.5772/6343

Downloaded: 2355

© 2008 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike-3.0 License, which permits use, distribution and reproduction for non-commercial purposes, provided the original is properly cited and derivative works building on this content are distributed under the same license.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Naoki Fukuta and Takayuki Ito (November 1st 2008). Parallel Greedy Approximation on Large-Scale Combinatorial Auctions, Greedy Algorithms, Witold Bednorz, IntechOpen, DOI: 10.5772/6343. Available from:

chapter statistics

2355total chapter downloads

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

Parallel Search Strategies for TSPs Using a Greedy Genetic Algorithm

By Yingzi Wei and Kanfeng Gu

Related Book

First chapter

Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches

By Rajesh Matai, Surya Singh and Murari Lal Mittal

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More About Us