Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Display Documents


Institute:
Collection:
Print in Citation style Print version     Display:
Sort by: Display records with Fulltext only
Entries: 1-5  
 Basket 
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
Authors: Das, Gautam; Kapoor, Sanjiv; Smid, Michiel
Date of Publication (YYYY-MM-DD): 1997
Title of Journal: Algorithmica
Volume: 19
Start Page: 447
End Page: 460
Document Type: Article
ID: 518014.0
New techniques for exact and approximate dynamic closest-point problems
Authors: Kapoor, Sanjiv; Smid, Michiel
Date of Publication (YYYY-MM-DD): 1996
Title of Journal: SIAM Journal on Computing
Volume: 25
Issue / Number: 4
Start Page: 775
End Page: 796
Document Type: Article
ID: 517815.0
On minimum 3-cuts and approximating k-cuts using cut trees
Authors: Kapoor, Sanjiv
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 1996
Title of Proceedings: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5)
Start Page: 132
End Page: 146
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 517834.0
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
Authors: Das, Gautam; Kapoor, Sanjiv; Smid, Michiel
Place of Publication: Berlin, Germany
Publisher: Springer
Date of Publication (YYYY-MM-DD): 1996
Title of Proceedings: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference
Start Page: 64
End Page: 75
Title of Series: Lecture Notes in Computer Science
Document Type: Conference-Paper
ID: 517771.0
Algorithms for Enumerating all Spanning Trees of an Undirected Graph
Authors: Hariharan, Ramesh; Kapoor, Sanjiv
Date of Publication (YYYY-MM-DD): 1995
Title of Journal: SIAM Journal on Computing
Volume: 24
Issue / Number: 2
Start Page: 247
End Page: 265
Document Type: Article
ID: 517854.0
Entries: 1-5  
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.