✦ LIBER ✦

A Polynomial Time Algorithm for Shaped Partition Problems

✍ Scribed by Hwang, Frank K.; Onn, Shmuel; Rothblum, Uriel G.

Book ID: 118204389
Publisher: Society for Industrial and Applied Mathematics
Year: 1999
Tongue: English
Weight: 343 KB
Volume: 10
Category: Article
ISSN: 1052-6234
DOI: 10.1137/s1052623497344002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for graph partit

A linear time algorithm for graph partition problems

✍ L.H. Clark; F. Shahrokhi; L.A. Székely 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

A Polynomial-Time Algorithm for Max-Min

A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders

✍ R. Becker; I. Lari; M. Lucertini; B. Simeone 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 434 KB

A polynomial-time optimization algorithm

A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation

✍ Maharaj Mukherjee; Kanad Chakraborty 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 102 KB

A polynomial-time algorithm for the chan

A polynomial-time algorithm for the change-making problem

✍ David Pearson 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 143 KB

A Polynomial-time Algorithm for the Bist

A Polynomial-time Algorithm for the Bistable Roommates Problem

✍ Jay Sethuraman; Chung-Piaw Teo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result

A polynomial time algorithm for a hemisp

A polynomial time algorithm for a hemispherical minimax location problem

✍ P. Das; N.R. Chakraborty; P.K. Chaudhuri 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 86 KB