Combinatorial Algorithms

Language: English

Published by Springer, Springer Jun 2023, 2023

3031343468 / 9783031343469

  • Softcover
  • New
See all details

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000

5-star seller

AbeBooks seller since January 23, 2017

Softcover

Condition: New

US$ 92.22

US$ 66.95 shipping 
Ships from Germany to U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

This item is printed on demand - Print on Demand Titel. Neuware -Multi-Priority Graph Sparsification.- Point Enclosure Problem for Homothetic Polygons.- Hardness of Balanced Mobiles.- Burn and Win.- Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness.- Advice Complexity Bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems.- Parameterized algorithms for Eccentricity Shortest Path Problem.- A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs.- Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks.- A Polyhedral Perspective on Tropical Convolutions.- Online Knapsack with Removal and Recourse.- Minimum Surgical Probing with Convexity Constraints.- A linear algorithm for radio k-coloring powers of paths having small diameter.- Capacity-Preserving Subgraphs of Directed Flow Networks.- Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms.- Finding Small CompleteSubgraphs Efficiently.- Maximal distortion of geodesic diameters in polygonal domains.- On 2-strong connectivity orientations of mixed graphs and related problems.- Make a Graph Singly Connected By Edge Orientations.- Computing the Center of Uncertain Points on Cactus Graphs.- Cosecure Domination: Hardness Results and Algorithms.- Optimal cost-based allocations under two-sided preferences.- Generating cyclic rotation Gray codes for stamp foldings and semi-meanders.- On Computing Large Temporal (Unilateral) Connected Components.- On Integer Linear Programs for Treewidth based on Perfect Elimination Orderings.- Finding Perfect Matching Cuts Faster.- Connected Feedback Vertex Set on AT-Free graphs.- Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries.- Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing.- Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism.- A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs.- Partial-Adaptive Submodular Maximization.- Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 432 pp. Englisch.…

Seller Inventory # 9783031343469

Title
Combinatorial Algorithms
Author
Sun-Yuan Hsieh
Publisher
Springer, Springer Jun 2023
Publication year
2023
Condition
Neu
Binding
Taschenbuch
Language
English
ISBN 10
3031343468
ISBN 13
9783031343469
Item weight
651 grams
Dimensions
235x155x24 mm

buchversandmimpf2000

Emtmannsberg, BAYE, Germany

5-star seller

AbeBooks seller since January 23, 2017

Shipping rates from Germany to U.S.A.

Item60 to 60 business days60 to 60 business days
First itemUS$ 66.95US$ 83.69
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay
  • Check
  • Paypal

Store description

Impressum Thorsten Retsch Buchversand Mimpf2000 Oberölschnitz 16 95517 Emtmannsberg Deutschland Telefon: 09209-2023188 Email: mimpf2000@online.de USt-ID-Nr.: DE 235096871 Wir führen gebrauchte Bücher aus allen Sparten der Literatur

Specialty

Modernes Antiquariat - Bücher von 1960 bis heute

Seller's business information

buchversandmimpf2000

Germany