Minimizing channel density with movable terminals

Saved in:

Bibliographic Details
Published in	Algorithmica Vol. 17; no. 2; pp. 89 - 99
Main Authors	Greenberg, R. I., Shih, J. -D.
Format	Journal Article
Language	English
Published	New York, NY Springer 01.02.1997
Subjects	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology Office automation, teleprocessing Software Theoretical computing Computer network Transmission channel Routing NP complete problem Distributed system Algorithm Computational complexity Terminal
Online Access	Get full text
ISSN	0178-4617 1432-0541
DOI	10.1007/BF02522820

Cover

Loading…

Author	Greenberg, R. I. Shih, J. -D.
Author_xml	– sequence: 1 givenname: R. I. surname: Greenberg fullname: Greenberg, R. I. – sequence: 2 givenname: J. -D. surname: Shih fullname: Shih, J. -D.
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2572168$$DView record in Pascal Francis
BookMark	eNpFkL1OwzAYAC1UJNrCwhNkYEIKfJ9_4xEqCkhFLDBHdmJTo8Sp7AhUnp6gIphuOd1wCzKLQ3SEnCNcIYC6vl0DFZRWFI7IHDmjJQiOMzIHVFXJJaoTssj5HQCp0nJO8CnE0IevEN-KZmtidF3RupjDuC8-w7gt-uHD2M4Vo0t9iKbLp-TYT3Bnv1yS1_Xdy-qh3DzfP65uNmVDUY2lkMJTW7VKWCuE1y3VFSBjhkJrjRBcGwQFHCTzUlouJjKhtVe65V5ztiQXh-7O5MZ0PpnYhFzvUuhN2tdUKIqymrTLg9akIefk_J-BUP88qf-fsG9Kn1N6
Cites_doi	10.1109/TC.1983.1676333 10.1109/TCAD.1985.1270117 10.1109/TCAD.1985.1270096 10.1109/43.97620
ContentType	Journal Article
Copyright	1997 INIST-CNRS
Copyright_xml	– notice: 1997 INIST-CNRS
DBID	AAYXX CITATION IQODW
DOI	10.1007/BF02522820
DatabaseName	CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1432-0541
EndPage	99
ExternalDocumentID	2572168 10_1007_BF02522820
GroupedDBID	-Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX AAYZH ABAKF ABBBX ABBRH ABBXA ABDBE ABDPE ABDZT ABECU ABFSG ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADHKG ADIMF ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFGCZ AFHIU AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WK8 YLTOR Z45 ZMTXR ZY4 ~EX ABRTQ IQODW
ID	FETCH-LOGICAL-c217t-565f2b8d75bb55f9d2980133a20dba5549a10704063f66b4563f3599f79d4f943
ISSN	0178-4617
IngestDate	Mon Jul 21 09:16:35 EDT 2025 Tue Jul 01 02:29:01 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Computer network Transmission channel Routing NP complete problem Distributed system Algorithm Computational complexity Terminal
Language	English
License	http://www.springer.com/tdm CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c217t-565f2b8d75bb55f9d2980133a20dba5549a10704063f66b4563f3599f79d4f943
PageCount	11
ParticipantIDs	pascalfrancis_primary_2572168 crossref_primary_10_1007_BF02522820
ProviderPackageCode	CITATION AAYXX
PublicationCentury	1900
PublicationDate	1997-02-01
PublicationDateYYYYMMDD	1997-02-01
PublicationDate_xml	– month: 02 year: 1997 text: 1997-02-01 day: 01
PublicationDecade	1990
PublicationPlace	New York, NY
PublicationPlace_xml	– name: New York, NY
PublicationTitle	Algorithmica
PublicationYear	1997
Publisher	Springer
Publisher_xml	– name: Springer
References	I. S. Gopal (BF02522820_CR4) 1983; 32 Y. Cai (BF02522820_CR1) 1991 BF02522820_CR3 T. G. Szymanski (BF02522820_CR9) 1985; 4 BF02522820_CR6 Y. Cai (BF02522820_CR2) 1991; 10 A. S. LaPaugh (BF02522820_CR7) 1983 R. I. Greenberg (BF02522820_CR5) 1988 J. Reed (BF02522820_CR8) 1985; 4
References_xml	– ident: BF02522820_CR3 – volume: 32 start-page: 845 issue: 9 year: 1983 ident: BF02522820_CR4 publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1983.1676333 – start-page: 123 volume-title: On minimizing channel density by lateral shifting year: 1983 ident: BF02522820_CR7 – volume: 4 start-page: 208 issue: 3 year: 1985 ident: BF02522820_CR8 publication-title: IEEE Trans. Computer-Aided Design Integrated Circuits doi: 10.1109/TCAD.1985.1270117 – volume: 4 start-page: 31 issue: 1 year: 1985 ident: BF02522820_CR9 publication-title: IEEE Trans. Computer-Aided Design Integrated Circuits doi: 10.1109/TCAD.1985.1270096 – volume: 10 start-page: 1413 issue: 11 year: 1991 ident: BF02522820_CR2 publication-title: IEEE Trans. Computer-Aided Design Integrated Circuits doi: 10.1109/43.97620 – start-page: 88 volume-title: Much: a multilayer channel router using one, two, and three layer partitions year: 1988 ident: BF02522820_CR5 – ident: BF02522820_CR6 – start-page: 524 volume-title: Minimizing channel density by shifting blocks and terminals year: 1991 ident: BF02522820_CR1
SSID	ssj0012796
Score	1.4615216
SourceID	pascalfrancis crossref
SourceType	Index Database
StartPage	89
SubjectTerms	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology Office automation, teleprocessing Software Theoretical computing
Title	Minimizing channel density with movable terminals
Volume	17
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
link	http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA66exHEt_imoLelpU2atDmuL3Rh9yAK3iRJU13YF-vqwV_vbJOmXfWgXkopSaD5yuSb6TczCJ0JITQlFLwTLMFBYVT5Umvhx7EKmYpYxou6Bd0eu3mIO4_0sWp9V2SXzGSgPn7MK_kPqvAMcJ1nyf4BWbcoPIB7wBeugDBcf4Vxtz_qD_sfRd7si5grVlrZXJAOxLqIrw7H70VmlFW8DF7rVLQ9eB5PYdSwptYpVDil4usuaN0GLgLz0i8CMJ2g5V8GVazA1Fl1ugsbPgSfMWYmWzLQxuTFBAZRU37K2cSkhj2uGTjT78celaa10TcjHJbScgzkLsVhddSUv9e_nEBOF1jWUK7mLqMmBgcAN1CzfX1-3nN_iHBS9F5zb7RYetbOXiAbqxPxCt99bhqW1FjE_QZas_TfaxssN9GSHm2h9bK1hmct7TaKKmg9C61nofXm0HoWWs9Bu4Merq_uL258293CV-AGznxg0jmWaZZQKSnNeYY5sAVCBA4zKYDlcQGuOdhYRnLGJBBdkhPKeZ7wLM55THZRYzQe6T3kSRXFioA1JQQIolAi4TKSqQ6VzghLw310Wm7D08QUMXn6vtX76Hhhh9xQsOo4YunBr1Y5RCvVl3eEGrPpmz4G3jaTJxbCT14YPgc
linkProvider	Library Specific Holdings
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Minimizing+channel+density+with+movable+terminals&rft.jtitle=Algorithmica&rft.au=Greenberg%2C+R.+I.&rft.au=Shih%2C+J.+-D.&rft.date=1997-02-01&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=17&rft.issue=2&rft.spage=89&rft.epage=99&rft_id=info:doi/10.1007%2FBF02522820&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_BF02522820
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon