Buy Network Design by Panos M. Pardalos - Bookswagon
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Mathematics and Science Textbooks > Mathematics > Applied mathematics > Network Design: Connectivity and Facilities Location(Series in Discrete Mathematics & Theoretical Computer Science)
Network Design: Connectivity and Facilities Location(Series in Discrete Mathematics & Theoretical Computer Science)

Network Design: Connectivity and Facilities Location(Series in Discrete Mathematics & Theoretical Computer Science)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Connectivity and facilities location are two important topics in network design, with applications in data communication, transportation, production planning, and VLSI designs. There are two issues concerning these topics: design and optimization. They involve combinatorial design and combinatorial optimization. This volume features talks presented at an interdisciplinary research workshop held at DIMACS in April 1997. The workshop was attended by leading theorists, algorithmists, and practitioners working on network design problems. Finding the solution of design problems and the optimal or approximate solution of the related optimization problem are challenging tasks because no polynomial time algorithms are known. Such problems include some variations of Steiner tree problems (such as multiple-connected Steiner network, independent flow problem, and subset-interconnection designs), topology network design, nonlinear assignment problems (such as quadratic assignment problems), problems in facilities location and allocation, and network problems appearing in VLSI design. The focus of this book is on combinatorial, algorithmic, and applicational aspects of these problems.

Table of Contents:
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems by S. Arora Differential greedy for the 0-1 equicut problem by R. Battiti and A. Bertossi Gradient-constrained minimal Steiner trees by M. Brazil, D. A. Thomas, and J. F. Weng The Steiner tree problem for terminals on the boundary of a rectilinear polygon by S.-W. Cheng Using Hadwiger numbers in network design by D. Cieslik Reducing the graphical Steiner problem with a sensitivity test by C. Duin A frequency assignment problem in cellular phone networks by A. Eisenblatter An optimal greedy algorithm for wavelength allocation in directed tree networks by T. Erlebach, K. Jansen, C. Kaklamanis, and P. Persiano A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem by K. Holmqvist, A. Migdalas, and P. M. Pardalos Approximation results for the optimum cost chromatic partition problem by K. Jansen Approximating dense cases of covering problems by M. Karpinski and A. Zelikovsky Connected facility location problems by S. Guha and S. Khuller Constrained spanning tree problems: Approximate methods and parallel computation by N. Deo and N. Kumar Star, grid, ring topologies in facility location & network design by W.-J. Li and J. M. Smith Network improvement problems by S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, and S. S. Ravi Improved results on service-constrained network design problems by M. V. Marathe, R. Ravi, and R. Sundaram A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem by R. A. Murphey, P. M. Pardalos, and L. Pitsoulis A generalized threshold algorithm for the shortest path problem with time windows by W. B. Powell and Z.-L. Chen A case study of derandomization methods for combinatorial approximation algorithms by J. D. P. Rolim and L. Trevisan A chunking based genetic algorithm for the Steiner tree problem in graphs by S. Voss and K. Gutenschwager A new exact algorithm for rectilinear Steiner trees by D. M. Warme A scalable TWDM lightwave network based on generalized de Bruijn digraph by P.-J. Wan and A. Pavan A new model of generalized Steiner trees and 3-coordinate systems by J. F. Weng A model for network design by R. Wessaly Nonlinear and mixed-integer optimization in chemical process network systems by C. S. Adjiman, C. A. Schweiger, and C. A. Floudas Shortest networks on spheres by M. Brazil, J. H. Rubinstein, D. A. Thomas, J. F. Weng, and N. C. Wormald.


Best Sellers


Product Details
  • ISBN-13: 9780821808344
  • Publisher: American Mathematical Society
  • Publisher Imprint: American Mathematical Society
  • Language: English
  • Returnable: N
  • Sub Title: Connectivity and Facilities Location
  • ISBN-10: 0821808346
  • Publisher Date: 30 Mar 1998
  • Binding: Hardback
  • No of Pages: 461
  • Series Title: Series in Discrete Mathematics & Theoretical Computer Science
  • Weight: 1049 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Network Design: Connectivity and Facilities Location(Series in Discrete Mathematics & Theoretical Computer Science)
American Mathematical Society -
Network Design: Connectivity and Facilities Location(Series in Discrete Mathematics & Theoretical Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Network Design: Connectivity and Facilities Location(Series in Discrete Mathematics & Theoretical Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!