Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents



ID: 356754.0, MPI für Informatik / Algorithms and Complexity Group
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Authors:Neumann, Frank; Wegener, Ingo
Language:English
Date of Publication (YYYY-MM-DD):2007
Title of Journal:Theoretical Computer Science
Volume:378
Issue / Number:1
Start Page:32
End Page:40
Review Status:Peer-review
Audience:Experts Only
Intended Educational Use:No
Last Change of the Resource (YYYY-MM-DD):2008-02-28
External Publication Status:published
Document Type:Article
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C12573CC004A8E26-DD35F633268055C4C125728B0033310A-...
DOI:10.1016/j.tcs.2006.11.002
ISSN:0304-3975
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.