English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem

Neumann, F., & Wegener, I. (2007). Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. Theoretical computer science, 378(1), 32-40. doi:10.1016/j.tcs.2006.11.002.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-000F-206D-B Version Permalink: http://hdl.handle.net/11858/00-001M-0000-0029-BEFC-0
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Neumann, Frank1, Author              
Wegener, Ingo2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2008-02-282007
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: Peer
 Identifiers: eDoc: 356754
DOI: 10.1016/j.tcs.2006.11.002
Other: Local-ID: C12573CC004A8E26-DD35F633268055C4C125728B0033310A-NeuWegMST2007
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Theoretical computer science
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier
Pages: - Volume / Issue: 378 (1) Sequence Number: - Start / End Page: 32 - 40 Identifier: ISSN: 0304-3975
CoNE: /journals/resource/954925512450