Coverart for item
The Resource Approximation and online algorithms : third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005 : revised papers, Thomas Erlebach, Giuseppe Persiano (eds.)

Approximation and online algorithms : third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005 : revised papers, Thomas Erlebach, Giuseppe Persiano (eds.)

Label
Approximation and online algorithms : third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005 : revised papers
Title
Approximation and online algorithms
Title remainder
third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005 : revised papers
Statement of responsibility
Thomas Erlebach, Giuseppe Persiano (eds.)
Title variation
WAOA 2005
Creator
Contributor
Subject
Genre
Language
eng
Summary
The third Workshop on Approximation and Online Algorithms (WAOA 2005) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of?elds. WAOA 2005 took place in Palma de Mallorca, Spain, on 6-7 October 2005. The workshop was part of the ALGO 2005 event that also hosted ESA, WABI, and ATMOS. The two previous WAOA workshops were held in Budapest (2003) and Rome (2004). Topics of interest for WAOA 2005 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms, rand- izationtechniques, real-worldapplications, andschedulingproblems. Inresponse to the call for papers we received 68 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 26 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system, whichwasusedtomanagetheelectronicsubmissions, thereviewprocess, and the electronic PC meeting. It made our task much easier. We would also like to thank all the authors who submitted papers to WAOA 2005 as well as the local organizers of ALGO 2005
Member of
Cataloging source
GW5XE
Dewey number
005.1
Illustrations
illustrations
Index
index present
LC call number
QA76.9.A43
LC item number
W42 2005
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2005
http://bibfra.me/vocab/lite/meetingName
WAOA 2005
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Erlebach, Thomas
  • Persiano, Giuseppe
Series statement
Lecture notes in computer science,
Series volume
3879
http://library.link/vocab/subjectName
  • Online algorithms
  • Mathematical optimization
  • Algorithmes en ligne
  • Optimisation mathématique
  • Informatique
  • Mathematical optimization
  • Online algorithms
Label
Approximation and online algorithms : third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005 : revised papers, Thomas Erlebach, Giuseppe Persiano (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
"Almost Stable" Matchings in the Roommates Problem -- On the Minimum Load Coloring Problem -- Improved Approximation Algorithms for MAXNAE-SAT and MAXSAT -- The Hardness of Network Design for Unsplittable Flow with Selfish Users -- Improved Approximation Algorithm for Convex Recoloring of Trees -- Exploiting Locality: Approximating Sorting Buffers -- Approximate Fair Cost Allocation in Metric Traveling Salesman Games -- Rounding of Sequences and Matrices, with Applications -- A Note on Semi-online Machine Covering -- SONET ADMs Minimization with Divisible Paths -- The Conference Call Search Problem in Wireless Networks -- Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents -- Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost -- A Better-Than-Greedy Algorithm for k-Set Multicover -- Deterministic Online Optical Call Admission Revisited -- Scheduling Parallel Jobs with Linear Speedup -- Online Removable Square Packing -- The Online Target Date Assignment Problem -- Approximation and Complexity of k-Splittable Flows -- On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem -- Tighter Approximations for Maximum Induced Matchings in Regular Graphs -- On Approximating Restricted Cycle Covers -- A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs -- Speed Scaling of Tasks with Precedence Constraints -- Partial Multicuts in Trees -- Approximation Schemes for Packing with Item Fragmentation
Control code
262692983
Dimensions
unknown
Extent
1 online resource (x, 347 pages)
Form of item
online
Isbn
9783540322085
Lccn
2006092553
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-32207-8
Publisher number
11671411
Specific material designation
remote
System control number
(OCoLC)262692983
Label
Approximation and online algorithms : third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005 : revised papers, Thomas Erlebach, Giuseppe Persiano (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
"Almost Stable" Matchings in the Roommates Problem -- On the Minimum Load Coloring Problem -- Improved Approximation Algorithms for MAXNAE-SAT and MAXSAT -- The Hardness of Network Design for Unsplittable Flow with Selfish Users -- Improved Approximation Algorithm for Convex Recoloring of Trees -- Exploiting Locality: Approximating Sorting Buffers -- Approximate Fair Cost Allocation in Metric Traveling Salesman Games -- Rounding of Sequences and Matrices, with Applications -- A Note on Semi-online Machine Covering -- SONET ADMs Minimization with Divisible Paths -- The Conference Call Search Problem in Wireless Networks -- Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents -- Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost -- A Better-Than-Greedy Algorithm for k-Set Multicover -- Deterministic Online Optical Call Admission Revisited -- Scheduling Parallel Jobs with Linear Speedup -- Online Removable Square Packing -- The Online Target Date Assignment Problem -- Approximation and Complexity of k-Splittable Flows -- On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem -- Tighter Approximations for Maximum Induced Matchings in Regular Graphs -- On Approximating Restricted Cycle Covers -- A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs -- Speed Scaling of Tasks with Precedence Constraints -- Partial Multicuts in Trees -- Approximation Schemes for Packing with Item Fragmentation
Control code
262692983
Dimensions
unknown
Extent
1 online resource (x, 347 pages)
Form of item
online
Isbn
9783540322085
Lccn
2006092553
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-540-32207-8
Publisher number
11671411
Specific material designation
remote
System control number
(OCoLC)262692983

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...